This page has only limited features, please log in for full access.
In the process of production and operation of family farms, a large amount of agricultural waste, such as livestock and poultry manure, has not been effectively treated in time, causing serious pollution to the environment. Moreover, livestock and poultry manure are the kind of resources that can be recycled to fertilize crops, which can benefit family farms both economically and environmentally. Adoption of manure biogas digesters by family farms can improve sustainability by not only decreasing input use and resource losses, but also reducing environmental pollution. Additionally, Material Flow Cost Accounting (MFCA) is considered to be the most representative environmental management accounting tool. MFCA can be expanded to account for and calculate environmental damages, so as to better reflect the economic and environmental sustainability of agricultural systems. According to the basic principles of material flow cost accounting and characteristics of family farms, we propose an agricultural-waste-recycling model for Chinese family farms that is based on the extended MFCA in this paper. We first investigate Chinese family farms in Hunan Province, and then optimize an agricultural-waste-recycling model by extended MFCA. Finally, based on our proposed model, we make a two-dimensional analysis on the internal resource cost and external environment damages for agricultural-waste recycling. Our analysis shows that visualization of monetization of resource losses can optimize manure recycling through better decision-making, which can increase the sustainability of family farms.
Lulu Yang; Xu Xiao; Ke Gu. Agricultural Waste Recycling Optimization of Family Farms Based on Environmental Management Accounting in Rural China. Sustainability 2021, 13, 5515 .
AMA StyleLulu Yang, Xu Xiao, Ke Gu. Agricultural Waste Recycling Optimization of Family Farms Based on Environmental Management Accounting in Rural China. Sustainability. 2021; 13 (10):5515.
Chicago/Turabian StyleLulu Yang; Xu Xiao; Ke Gu. 2021. "Agricultural Waste Recycling Optimization of Family Farms Based on Environmental Management Accounting in Rural China." Sustainability 13, no. 10: 5515.
Vehicle to Grid (V2G) networks are facing many security problems, such as privacy protection and identity authentication for electric vehicle (EV) users. To solve these problems of identity authentication in V2G networks, we propose a charging identity authentication scheme based on fog computing in this paper. In our proposed scheme, when each EV user finished his registration, all related servers must authenticate the users’ identities; also, when an EV user needs to start charging, the related fog server must authenticate his identity and save the related electricity information after charging. Further, the electricity server (ES) can periodically audit the electricity consumption from the fog servers in our scheme. Based on fog computing, the efficiency of our proposed V2G network charging scheme is improved by reducing the number of interactions between EV users and cloud servers. Also, we analyze the security of our proposed scheme, where our proposed scheme can use group signatures to protect the privacy of EV users. The experimental results show that our proposed scheme is effective and efficient.
Zhuoqun Xia; Zhenwei Fang; Ke Gu; Jing Wang; Jingjing Tan; Guanghui Wang. Effective charging identity authentication scheme based on fog computing in V2G networks. Journal of Information Security and Applications 2021, 58, 102649 .
AMA StyleZhuoqun Xia, Zhenwei Fang, Ke Gu, Jing Wang, Jingjing Tan, Guanghui Wang. Effective charging identity authentication scheme based on fog computing in V2G networks. Journal of Information Security and Applications. 2021; 58 ():102649.
Chicago/Turabian StyleZhuoqun Xia; Zhenwei Fang; Ke Gu; Jing Wang; Jingjing Tan; Guanghui Wang. 2021. "Effective charging identity authentication scheme based on fog computing in V2G networks." Journal of Information Security and Applications 58, no. : 102649.
To improve the issue of low-frequency and high-frequency components from feature maps being treated equally in existing image super-resolution reconstruction methods, the paper proposed an image super-resolution reconstruction method using attention mechanism with feature map to facilitate reconstruction from original low-resolution images to multi-scale super-resolution images. The proposed model consists of a feature extraction block, an information extraction block, and a reconstruction module. Firstly, the extraction block is used to extract useful features from low-resolution images, with multiple information extraction blocks being combined with the feature map attention mechanism and passed between feature channels. Secondly, the interdependence is used to adaptively adjust the channel characteristics to restore more details. Finally, the reconstruction module reforms different scales high-resolution images. The experimental results can demonstrate that the proposed method can effectively improve not only the visual effect of images but also the results on the Set5, Set14, Urban100, and Manga109. The results can demonstrate the proposed method has structurally similarity to the image reconstruction methods. Furthermore, the evaluating indicator of Peak Signal to Noise Ratio (PSNR) and Structural Similarity Index (SSIM) has been improved to a certain degree, while the effectiveness of using feature map attention mechanism in image super-resolution reconstruction applications is useful and effective.
Yuantao Chen; Linwu Liu; Volachith Phonevilay; Ke Gu; Runlong Xia; Jingbo Xie; Qian Zhang; Kai Yang. Image super-resolution reconstruction based on feature map attention mechanism. Applied Intelligence 2021, 51, 4367 -4380.
AMA StyleYuantao Chen, Linwu Liu, Volachith Phonevilay, Ke Gu, Runlong Xia, Jingbo Xie, Qian Zhang, Kai Yang. Image super-resolution reconstruction based on feature map attention mechanism. Applied Intelligence. 2021; 51 (7):4367-4380.
Chicago/Turabian StyleYuantao Chen; Linwu Liu; Volachith Phonevilay; Ke Gu; Runlong Xia; Jingbo Xie; Qian Zhang; Kai Yang. 2021. "Image super-resolution reconstruction based on feature map attention mechanism." Applied Intelligence 51, no. 7: 4367-4380.
Although some existing collaborative intrusion detection sch-emes can increase the detection performance by dynamically allocating detection resources in smart grids, these related works fail to consider the optimization of resource allocation between IDSs under the condition of resource restriction. In this paper, considering the effect of resource restriction, we propose a resource allocation scheme for two-layer collaborative IDSs based on sharing strategies in smart grids. In the first layer of our scheme, we model the interaction between the IDSs and the attackers through a stochastic game based on sharing strategies, where we provide each IDS with two different options for its strategy updating at each stage in the stochastic game. Then the resource updating strategies of the IDSs are obtained through this proposed model. Further, in the second layer we quantify the effect of detection resource restriction, and we propose a resource allocation method under the condition of detection resource restriction, where each IDS can obtain its detection resources according to the results generated by our proposed stochastic game. Based on our experimental analysis, compared with other resource allocation schemes, our proposed scheme can more quickly achieve the Nash equilibrium between the IDSs and the attackers to make the IDSs obtain more rewards, and then can more rationally promote the IDSs to update their detection resources so that the IDSs obtain the optimal detection strategies under the condition of resource restriction. Our proposed scheme can achieve effective detection resource allocation between IDSs for the security of neighborhood area network in smart grids.
Zhuoqun Xia; Jingjing Tan; Ke Gu; Weijia Jia. Detection resource allocation scheme for two-layer cooperative IDSs in smart grids. Journal of Parallel and Distributed Computing 2020, 147, 236 -247.
AMA StyleZhuoqun Xia, Jingjing Tan, Ke Gu, Weijia Jia. Detection resource allocation scheme for two-layer cooperative IDSs in smart grids. Journal of Parallel and Distributed Computing. 2020; 147 ():236-247.
Chicago/Turabian StyleZhuoqun Xia; Jingjing Tan; Ke Gu; Weijia Jia. 2020. "Detection resource allocation scheme for two-layer cooperative IDSs in smart grids." Journal of Parallel and Distributed Computing 147, no. : 236-247.
Fog computing needs to seamlessly integrate heterogeneous computing resources widely distributed in edge networks, and then, it can provide unified resources and services for users. However, due to a large number of fog nodes, there are still many security problems in the fog computing process. For example, when fog servers make resource allocation between users' tasks and fog nodes, some fog nodes can falsely claim that they have more resources than their actual ability, so as to get more task processing qualifications. Thus, it will greatly damage the interests of users and affect the quality of service. In this article, we propose a resource allocation scheme for community-based fog computing based on a reputation mechanism. When fog network provides computing services for users, we use a reputation mechanism to enable users to obtain reliable resources in fog computing. In our proposed scheme, a user first submits his/her task request to the community-based fog network, and then, the fog server makes a reliable resource allocation process based on multiple-layer communities and reputation calculation. Based on our experiments, our scheme enables users to obtain reliable resources and improves the service quality of computing resources in fog computing.
Ke Gu; Linyu Tang; Jiafu Jiang; Weijia Jia. Resource Allocation Scheme for Community-Based Fog Computing Based on Reputation Mechanism. IEEE Transactions on Computational Social Systems 2020, 7, 1246 -1263.
AMA StyleKe Gu, Linyu Tang, Jiafu Jiang, Weijia Jia. Resource Allocation Scheme for Community-Based Fog Computing Based on Reputation Mechanism. IEEE Transactions on Computational Social Systems. 2020; 7 (5):1246-1263.
Chicago/Turabian StyleKe Gu; Linyu Tang; Jiafu Jiang; Weijia Jia. 2020. "Resource Allocation Scheme for Community-Based Fog Computing Based on Reputation Mechanism." IEEE Transactions on Computational Social Systems 7, no. 5: 1246-1263.
Currently it becomes more difficult for a single intrusion detection system (IDS) to detect complex attacks. Base on some cooperative intrusion detection mechanisms, multiple IDSs increase the detection performance against network attacks by sharing their knowledge and consulting with each other. However, these related works hardly consider the IDS configuration optimization problem and the adaptive collaborative attack problem. In this paper, we first propose an advanced adaptive attack based on intrusion-sharing incentive mechanism to promote mutual consultation and collaboration among intelligent attackers; then in order to detect and defend this attack, an IDS intelligent configuration scheme based on evolutionary game is proposed, where each IDS in network can intelligently configure its detection libraries according to the related evolutionary stability strategy. Based on our experimental analysis, the proposed scheme can achieve optimal IDS configuration against the advanced adaptive attack, which is superior to other IDS configuration schemes.
Zhuoqun Xia; Jingjing Tan; Ke Gu; Xiong Li; Weijia Jia. IDS Intelligent Configuration Scheme Against Advanced Adaptive Attacks. IEEE Transactions on Network Science and Engineering 2020, 8, 995 -1008.
AMA StyleZhuoqun Xia, Jingjing Tan, Ke Gu, Xiong Li, Weijia Jia. IDS Intelligent Configuration Scheme Against Advanced Adaptive Attacks. IEEE Transactions on Network Science and Engineering. 2020; 8 (2):995-1008.
Chicago/Turabian StyleZhuoqun Xia; Jingjing Tan; Ke Gu; Xiong Li; Weijia Jia. 2020. "IDS Intelligent Configuration Scheme Against Advanced Adaptive Attacks." IEEE Transactions on Network Science and Engineering 8, no. 2: 995-1008.
In vehicle ad hoc networks (VANETs), if a legal vehicle node becomes malicious, then it is more likely to tamper with transferred data or provide false data easily. Because the malicious node is a valid internal user in VANETs, its behaviour is difficult to be detected only through some cryptographic methods. Then the behaviour may cause many serious traffic accidents. Based on the available (unencrypted) data only, how to detect out the internal malicious vehicle nodes by some lightweight methods needs to be researched in VANETs. Additionally, fog computing seamlessly integrates heterogeneous computing resources widely distributed in edge networks and then provides stronger computing services for users. Therefore, in this paper, we propose a malicious node detection scheme in fog computing-based VANETs, where the fog server uses the reputation calculation to score each suspicious node based on the correlation of acquired data and network topology. In our proposed scheme, we build a reputation mechanism to score each suspicious node according to the correlation between outlier detection of acquired data and influence of nodes. Based on our proposed experiments, our proposed scheme can efficiently and effectively detect out malicious vehicle nodes so that fog server can acquire more true data.
Ke Gu; Xingying Dong; Weijia Jia. Malicious Node Detection Scheme Based on Correlation of Data and Network Topology in Fog Computing-based VANETs. IEEE Transactions on Cloud Computing 2020, PP, 1 -1.
AMA StyleKe Gu, Xingying Dong, Weijia Jia. Malicious Node Detection Scheme Based on Correlation of Data and Network Topology in Fog Computing-based VANETs. IEEE Transactions on Cloud Computing. 2020; PP (99):1-1.
Chicago/Turabian StyleKe Gu; Xingying Dong; Weijia Jia. 2020. "Malicious Node Detection Scheme Based on Correlation of Data and Network Topology in Fog Computing-based VANETs." IEEE Transactions on Cloud Computing PP, no. 99: 1-1.
The development of the Internet of Things (IoT) plays a very important role for processing data at the edge of a network. Therefore, it is very important to protect the privacy of IoT devices when these devices process and transfer data. A mesh signature (MS) is a useful cryptographic tool, which makes a signer sign any message anonymously. As a result, the signer can hide his specific identity information to the mesh signature, namely his identifying information (such as personal public key) may be hidden to a list of tuples that consist of public key and message. Therefore, we propose an improved mesh signature scheme for IoT devices in this paper. The IoT devices seen as the signers may sign their publishing data through our proposed mesh signature scheme, and their specific identities can be hidden to a list of possible signers. Additionally, mesh signature consists of some atomic signatures, where the atomic signatures can be reusable. Therefore, for a large amount of data published by the IoT devices, the atomic signatures on the same data can be reusable so as to decrease the number of signatures generated by the IoT devices in our proposed scheme. Compared with the original mesh signature scheme, the proposed scheme has less computational costs on generating final mesh signature and signature verification. Since atomic signatures are reusable, the proposed scheme has more advantages on generating final mesh signature by reconstructing atomic signatures. Furthermore, according to our experiment, when the proposed scheme generates a mesh signature on 10 MB message, the memory consumption is only about 200 KB. Therefore, it is feasible that the proposed scheme is used to protect the identity privacy of IoT devices.
Ke Gu; Wenbin Zhang; Se-Jung Lim; Pradip Kumar Sharma; Zafer Al-Makhadmeh; Amr Tolba. Reusable Mesh Signature Scheme for Protecting Identity Privacy of IoT Devices. Sensors 2020, 20, 758 .
AMA StyleKe Gu, Wenbin Zhang, Se-Jung Lim, Pradip Kumar Sharma, Zafer Al-Makhadmeh, Amr Tolba. Reusable Mesh Signature Scheme for Protecting Identity Privacy of IoT Devices. Sensors. 2020; 20 (3):758.
Chicago/Turabian StyleKe Gu; Wenbin Zhang; Se-Jung Lim; Pradip Kumar Sharma; Zafer Al-Makhadmeh; Amr Tolba. 2020. "Reusable Mesh Signature Scheme for Protecting Identity Privacy of IoT Devices." Sensors 20, no. 3: 758.
Fog computing has become an emerging environment that provides data storage, computing and some other services on the edge of network. It not only can acquire data from terminal devices, but also can provide computing services to users by opening computing resources. Compared with cloud computing, fog devices can collaborate to provide users with powerful computing services through resource allocation. However, as many of fog devices are not monitored, there are some security problems. For example, since fog server processes and maintains user information, device information, task parameters and so on, fog server is easy to perform illegal resource allocation for extra benefits. In this paper, we propose a secure computing resource allocation framework for open fog computing. In our scheme, the fog server is responsible for processing computing requests and resource allocations, and the cloud audit center is responsible for auditing the behaviors of the fog servers and fog nodes. Based on the proposed security framework, our proposed scheme can resist the attack of single malicious node and the collusion attack of fog server and computing devices. Furthermore, the experiments show our proposed scheme is efficient. For example, when the number of initial idle service devices is 40, the rejection rate of allocated tasks is 10% and the total number of sub-tasks is changed from 150 to 200, the total allocation time of our scheme is only changed from 15 ms to 25 ms; additionally, when the task of 5000 order matrix multiplication is tested on 10 service devices, the total computing time of our scheme is $\sim$250 s, which is better than that of single computer (where single computer needs more than 1500 s). Therefore, our proposed scheme has obvious advantages when it faces some tasks that require more computational cost, such as complex scientific computing, distributed massive data query, distributed image processing and so on.
Jiafu Jiang; Linyu Tang; Ke Gu; Weijia Jia. Secure Computing Resource Allocation Framework For Open Fog Computing. The Computer Journal 2020, 63, 567 -592.
AMA StyleJiafu Jiang, Linyu Tang, Ke Gu, Weijia Jia. Secure Computing Resource Allocation Framework For Open Fog Computing. The Computer Journal. 2020; 63 (4):567-592.
Chicago/Turabian StyleJiafu Jiang; Linyu Tang; Ke Gu; Weijia Jia. 2020. "Secure Computing Resource Allocation Framework For Open Fog Computing." The Computer Journal 63, no. 4: 567-592.
Ke Gu; Xinying Dong; Linyu Wang. Efficient traceable ring signature scheme without pairings. Advances in Mathematics of Communications 2020, 14, 207 -232.
AMA StyleKe Gu, Xinying Dong, Linyu Wang. Efficient traceable ring signature scheme without pairings. Advances in Mathematics of Communications. 2020; 14 (2):207-232.
Chicago/Turabian StyleKe Gu; Xinying Dong; Linyu Wang. 2020. "Efficient traceable ring signature scheme without pairings." Advances in Mathematics of Communications 14, no. 2: 207-232.
Currently many factors can influence community detection in mobile social networks, where node mobility is a key factor to influence the stability of community structure. In this paper, we propose a social community detection scheme for mobile social networks based on social-ware, including social attribute similarity, node interest similarity and node mobility. Compared with other community detection schemes, our proposed scheme can accurately detect the communities based on community attribute and node mobility. The experiments show the numbers of detected communities and members in the maximal size community generated by our scheme are both smaller than those of the GN and NM schemes. Additionally, since the nodes (users) both have higher mobility in mobile social networks, the efficiency of our proposed scheme relatively becomes higher. The experiments show when the values of mobility in the test data sets increase, the running time of our proposed scheme decreases when the number of edges is fixed. For example, the running time of our proposed scheme is about 17s when the maximum value of mobility is set as 0.5 and the number of edges is about 16000, and further the running time is only about 13s when the maximum value of mobility is set as 1. Therefore, our proposed scheme can more accurately and efficiently make community detection to increase the stability of mobile community structure.
Ke Gu; Dianxing Liu; Keming Wang. Social Community Detection Scheme Based on Social-Aware in Mobile Social Networks. IEEE Access 2019, 7, 173407 -173418.
AMA StyleKe Gu, Dianxing Liu, Keming Wang. Social Community Detection Scheme Based on Social-Aware in Mobile Social Networks. IEEE Access. 2019; 7 (99):173407-173418.
Chicago/Turabian StyleKe Gu; Dianxing Liu; Keming Wang. 2019. "Social Community Detection Scheme Based on Social-Aware in Mobile Social Networks." IEEE Access 7, no. 99: 173407-173418.
Traceable attribute-based signature (TABS) is a useful cryptographic tool to protect the real signers’ identities while tracing the real signers under some conditions. Traceable attribute-based signature inherits the merits of attribute-based signature, where each signer can sign any messages with fine-grained control over identity information. Since attribute-based signature can hide the identities of real signers to protect their privacy, it can bring about another security issue. For example, some signers abuse attribute-based signatures to sign any messages, and the abusing behaviour cannot be traced. To solve this problem, traceable attribute-based signature is proposed to balance the usage of attribute-based signatures. Traceable attribute-based signature may protect the privacy of real signers, and it may trace the identities of real signers by trusted third party under some conditions. Currently few traceable attribute-based signature schemes are proposed. Escala et al. proposed a traceable attribute-based signature scheme in the standard model, which can trace the identities of real signers. However, their scheme only supports that the attribute predicates are solely conjunction of attributes. Okamoto et al. proposed an attribute-based signature scheme in the standard model, their scheme can support generalized non-monotone predicates. However, their scheme does not have the traceability. In this paper, we present a traceable attribute-based signature scheme for monotone predicates in the standard model. Compared with other traceable attribute-based signature schemes, our proposed scheme is efficient.
Ke Gu; Keming Wang; Lulu Yang. Traceable attribute-based signature. Journal of Information Security and Applications 2019, 49, 102400 .
AMA StyleKe Gu, Keming Wang, Lulu Yang. Traceable attribute-based signature. Journal of Information Security and Applications. 2019; 49 ():102400.
Chicago/Turabian StyleKe Gu; Keming Wang; Lulu Yang. 2019. "Traceable attribute-based signature." Journal of Information Security and Applications 49, no. : 102400.
Fog computing is used to process a large amount of data produced by terminal devices where fog nodes are the closest acquirers to the terminal devices. In fog computing, the processed data may be tampered with or illegally captured by some malicious nodes while the data is transferred or stored. So, when some applications need to require data process with high security, fog computing must provide a security approach to secure and check the final results. In this paper, we propose a secure data sequence query framework based on multiple fog servers, where we use multiple fog servers to store and provide data hashing values to verify corresponding data sequence. In the proposed scheme, the cloud server needs to pre-designate some Merkle hashing tree topologies to the fog network, then the fog server directly acquires related data from leaf-nodes (fog nodes) according to one of the pre-designated Merkle hashing tree topologies; at the same time, an actual Merkle hashing tree is constructed according to the selected Merkle hashing tree topology in the fog network. In fog computing, the related fog nodes participate in computing and transferring the hashing values on data, then the corresponding root node uses the (t; n) threshold secret sharing scheme to compute and distribute the sub-secrets of the root value to other fog servers. Therefore, when a user requests a data sequence from a fog server, the fog server may immediately respond to the request and the other fog servers can provide the sub-secrets of hashing root value to verify the corresponding data sequence. Our proposed framework can ensure that users may obtain required data fast, accurately and reliably. Additionally, based on the data query security requirements of fog computing, we analyze the security of our proposed scheme. Our proposed scheme not only guarantees the reliability of data but also effectively protects data against various attacks.
Ke Gu; Na Wu; Bo Yin; Weijia Jia. Secure Data Sequence Query Framework Based on Multiple Fogs. IEEE Transactions on Emerging Topics in Computing 2019, 1 -1.
AMA StyleKe Gu, Na Wu, Bo Yin, Weijia Jia. Secure Data Sequence Query Framework Based on Multiple Fogs. IEEE Transactions on Emerging Topics in Computing. 2019; (99):1-1.
Chicago/Turabian StyleKe Gu; Na Wu; Bo Yin; Weijia Jia. 2019. "Secure Data Sequence Query Framework Based on Multiple Fogs." IEEE Transactions on Emerging Topics in Computing , no. 99: 1-1.
In the era of data deluge, data analysis has become a key task for many industrial applications, e.g., master data management, and data integration. In particular, similarity join is an important primitive operator to support data analysis, which is to find similar pairs based on similarity functions and thresholds. In this paper, we first propose a new similarity join operation called the dynamic skyline join without having to specify any similarity function or similarity threshold, which measures the similarity through multi-criteria optimization. The dynamic skyline join operator makes the similarity join more flexible to support different criteria in multi-dimensional space. However, it is non-trivial to achieve dynamic skyline joins as both join operations and dynamic skyline queries are computationally complex in the increasing volume of real-world data. Therefore, we further propose Grid-SkyJoin, a framework to enable efficient parallel dynamic skyline joins on a shared-nothing cluster. Specifically, we use a grid partitioning to facilitate the data filtering and grouping strategies to provide load-balancing and reduce the number of replicas. We also propose a multi-level filtering scheme to prune away a large fraction of unpromising points that do not fit into join results without actual join operations. Extensive experiments using benchmark datasets demonstrate that our filtering scheme can greatly reduce the number of data points to be joined, and our approach is about two times faster compared with the straightforward method in average.
Bo Yin; Xuetao Wei; Jin Wang; Naixue Xiong; Ke Gu. An Industrial Dynamic Skyline Based Similarity Joins For Multidimensional Big Data Applications. IEEE Transactions on Industrial Informatics 2019, 16, 2520 -2532.
AMA StyleBo Yin, Xuetao Wei, Jin Wang, Naixue Xiong, Ke Gu. An Industrial Dynamic Skyline Based Similarity Joins For Multidimensional Big Data Applications. IEEE Transactions on Industrial Informatics. 2019; 16 (4):2520-2532.
Chicago/Turabian StyleBo Yin; Xuetao Wei; Jin Wang; Naixue Xiong; Ke Gu. 2019. "An Industrial Dynamic Skyline Based Similarity Joins For Multidimensional Big Data Applications." IEEE Transactions on Industrial Informatics 16, no. 4: 2520-2532.
Currently blockchain technology has been widely researched and is being applied to many other fields, such as financial transactions, E-government, logistics and supply-chain system and so on. It can be used to store and maintain transaction data through de-centralized model. In this paper, we propose an autonomous resource request transaction framework based on blockchain in social network, in which all kinds of resources in social community can be traded through blockchain technology. When a user needs to acquire some resources from a community, the user may make transaction with the members from the community through blockchain technology while the members autonomously negotiate each other to reach an agreement. And the proposed framework provides an incentive mechanism to encourage the community members to disseminate the resources through smart contract.
Ke Gu; Linyu Wang; Weijia Jia. Autonomous Resource Request Transaction Framework Based on Blockchain in Social Network. IEEE Access 2019, 7, 43666 -43678.
AMA StyleKe Gu, Linyu Wang, Weijia Jia. Autonomous Resource Request Transaction Framework Based on Blockchain in Social Network. IEEE Access. 2019; 7 (99):43666-43678.
Chicago/Turabian StyleKe Gu; Linyu Wang; Weijia Jia. 2019. "Autonomous Resource Request Transaction Framework Based on Blockchain in Social Network." IEEE Access 7, no. 99: 43666-43678.
In recent decades, the application demand of current comparator has increased rapidly, which makes the structure of current comparator mature and becomes an important part of many circuits. Current comparator will replace voltage comparator because of its excellent performance. This paper summarizes the recently proposed comparator circuit structures and shows the main parameters which have an impressive influence on the performance of the comparator. A variety of types of current comparator are described, including the traditional current comparator, the compensated current comparator, the current comparator based on CCII (Second Generation Current Conveyor), switched current comparator, current comparator based on reduced structure, etc. This paper could provide guidance for the development of high performance current comparators.
Fei Yu; Lei Gao; Lixiang Li; Ke Gu; Weizheng Wang; Shuo Cai. A Survey on the Design of Current Comparator. 2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT) 2019, 426 -431.
AMA StyleFei Yu, Lei Gao, Lixiang Li, Ke Gu, Weizheng Wang, Shuo Cai. A Survey on the Design of Current Comparator. 2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT). 2019; ():426-431.
Chicago/Turabian StyleFei Yu; Lei Gao; Lixiang Li; Ke Gu; Weizheng Wang; Shuo Cai. 2019. "A Survey on the Design of Current Comparator." 2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT) , no. : 426-431.
In this paper, our works mainly focus on providing a frame for the privacy protection of location data mining. We propose a location data record privacy protection scheme based on differential privacy mechanism, which employs the structure of multi-level query tree to query and publish location data on database.DOI: http://dx.doi.org/10.5755/j01.itc.47.4.19320
Ke Gu; Lihao Yang; Bo Yin. Location Data Record Privacy Protection based on Differential Privacy Mechanism. Information Technology and Control 2018, 47, 639-654 .
AMA StyleKe Gu, Lihao Yang, Bo Yin. Location Data Record Privacy Protection based on Differential Privacy Mechanism. Information Technology and Control. 2018; 47 (4):639-654.
Chicago/Turabian StyleKe Gu; Lihao Yang; Bo Yin. 2018. "Location Data Record Privacy Protection based on Differential Privacy Mechanism." Information Technology and Control 47, no. 4: 639-654.
A new CMOS second generation current controlled current conveyor (CCCII) structure is reported in this paper. The proposed circuit adopts cascode current mirrors, which X-terminal and Y-terminal are used MOS composite tube in series structure with good following characteristics, large linear range, low power consumption and port parasitic resistance control characteristics. Finally, the circuit is simulated by Pspice using 0.18 μm process. The linear input ranges of X-terminal and Y-terminal are -2 ~ 2 mA and -2 ~ 2 V, respectively. The offset current of Z-terminal is 0.65 μA, and the power consumption of the circuit is only 0.415 μW at 2 V supply voltage.
Fei Yu; Ping Li; Lei Gao; Shuo Cai; Ke Gu; Weizheng Wang. A Second Generation Current Controlled Current Conveyor Realization Using Cascode Current Mirror : A CCCII Realization Using Cascode Current Mirror. 2018 10th International Conference on Communications, Circuits and Systems (ICCCAS) 2018, 29 -33.
AMA StyleFei Yu, Ping Li, Lei Gao, Shuo Cai, Ke Gu, Weizheng Wang. A Second Generation Current Controlled Current Conveyor Realization Using Cascode Current Mirror : A CCCII Realization Using Cascode Current Mirror. 2018 10th International Conference on Communications, Circuits and Systems (ICCCAS). 2018; ():29-33.
Chicago/Turabian StyleFei Yu; Ping Li; Lei Gao; Shuo Cai; Ke Gu; Weizheng Wang. 2018. "A Second Generation Current Controlled Current Conveyor Realization Using Cascode Current Mirror : A CCCII Realization Using Cascode Current Mirror." 2018 10th International Conference on Communications, Circuits and Systems (ICCCAS) , no. : 29-33.
Long range technology (LoRa) is a wireless communication technology, which may provide low-power, low-rate and long-range communication. It may widely be used into many applications, such as smart metering and factory monitoring. However, some features of LoRa technology also bring new security weaknesses. Therefore, we propose an improved session key management to secure the meterreading system based on LoRa technology. In our proposed scheme, we add a trusted key distribution server for the related devices to generate their session keys and manage all the keys, where the symmetric session keys are used to protect the communication data between the servers and the terminal devices. Additionally, in order to maintain the long-term security of the proposed meter reading system, our proposed lightweight key management scheme can update the session keys automatically and remotely. Finally, we make analysis and experiments to evaluate our proposed key management scheme for the meter-reading system, the related results show our proposed scheme is secure and effective.
Zhuoqun Xia; Hong Zhou; Ke Gu; Bo Yin; Youyou Zeng; Ming Xu. Secure Session Key Management Scheme for Meter-Reading System Based on LoRa Technology. IEEE Access 2018, 6, 75015 -75024.
AMA StyleZhuoqun Xia, Hong Zhou, Ke Gu, Bo Yin, Youyou Zeng, Ming Xu. Secure Session Key Management Scheme for Meter-Reading System Based on LoRa Technology. IEEE Access. 2018; 6 (99):75015-75024.
Chicago/Turabian StyleZhuoqun Xia; Hong Zhou; Ke Gu; Bo Yin; Youyou Zeng; Ming Xu. 2018. "Secure Session Key Management Scheme for Meter-Reading System Based on LoRa Technology." IEEE Access 6, no. 99: 75015-75024.
With the development of social network, network digital sources have become a main kind of information services for users. In social network, user's needs and interpersonal relationships become very rich, thus social network can quickly disseminate digital sources to users. In this paper, we propose a resource transaction framework based on block chain, which is used to disseminate digital resources through social community. Based on block chain technology, the proposed scheme changes the traditional method of charging and can provide the reliability and fairness for every transaction of digital resource.
Linyu Wang; Bo Yin; Ke Gu. Resource Transaction Framework Based on Block Chain in Social Community. 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) 2018, 1265 -1270.
AMA StyleLinyu Wang, Bo Yin, Ke Gu. Resource Transaction Framework Based on Block Chain in Social Community. 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI). 2018; ():1265-1270.
Chicago/Turabian StyleLinyu Wang; Bo Yin; Ke Gu. 2018. "Resource Transaction Framework Based on Block Chain in Social Community." 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) , no. : 1265-1270.