检索结果-内蒙古大学图书馆

A priority-based blockchain transaction packaging algorithm in a cloud-edge-end collaboration computing environment

Knowledge and Information Systems 2025年 1-34页

作者： Li, Chunlin Zeng, Haibo Jiang, Kun Yang, Kaijun Yang, Shaohua Jia, Qingren Ministry of Industry and Information Technology Beijing China The Second Surveying and Mapping Institute of Hunan Province Hunan Changsha China Department of Computer Science Wuhan University of Technology Wuhan430063 China Anhui Provincial Key Laboratory of Philosophy and Social Sciences for Digital Rural Construction and Governance & School of Management Anhui Science and Technology University Anhui Chuzhou China College of Electronic Science and Technology National University of Defense Technology Hunan Changsha China

With the rapid development of mobile internet, intelligent IoT, and 5G communication technologies, many IoT devices connect to the Industrial Internet of Things, generating significant data. Blockchain is widely used in identity authentication and trust management due to its reliability. In blockchain technology, transaction packaging is a crucial component of the consensus mechanism and is critical to enhancing fairness and service quality in request processing. However, the flat structure of the blockchain, the necessity for multi-party consensus, and the profit-seeking nature of nodes lead to issues such as unfair transaction processing and prolonged response times in cloud-edge-end architectures, which are critical for empowering intelligent edge applications. To address these challenges, we have refined the blockchain consensus mechanism and introduced a novel packaging algorithm, ITFPA (Improved time-fee packaging algorithm), within the cloud-edge-end environment. This algorithm models the transaction packaging problem as a 0–1 knapsack problem and employs a branch-and-bound method to find the optimal solution. The proposed model considers both the transaction waiting time and transaction fee, using the weighted result of these factors as the priority for the transaction. We compared the proposed algorithm with the WaitTime and TxFee algorithms across four metrics: system fairness, transaction response time, and block priority. The experimental results demonstrate that the proposed algorithm enhances system fairness, reduces transaction response times, and improves service quality to a significant degree. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Industrial internet of things (IIoT)

来源：评论

学校读者我要写书评

暂无评论

Delay-Oriented Transaction Packaging Ordering in Sharded Blockchains

引用

IEEE Transactions on Network Science and Engineering 2025年

作者： Fan, Yuqi Wang, Xiaoyu Wu, Weili Du, Dingzhu Hefei University of Technology School of Computer Science and Information Engineering Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China University of Texas at Dallas Department of Computer Science RichardsonTX75080 United States

In blockchain, miners make profits by packaging transactions. There are a large number of pending transactions in the blockchain, and users often assign high transaction fees to reduce the delay in transaction packaging. However, in sharded blockchains, it requires more computational and communication resources to process cross-shard transactions than intra-shardtransactions. As a result, miners are inclined to package intra-shard transactions to maximize their profits when packaging transactions, and cross-shard transactions with higher transaction fees are unable to be processed in time, which degrades the quality of service (QoS) of users. That is, the existing transaction packaging methods lack a clear mechanism to ensure that the QoS of users is directly related to the transaction fees they pay. In this paper, we design a new incentive mechanism, such that the block reward is not a fixed value but is related to the transaction processing delay and the number of cross-shard communications involved. The block reward can encourage miners to process transactions in time. We then study how to maximize the total miners’ profit by determining the appropriate transaction packaging order to provide QoS to users. Specifically, we model the problem of transaction packaging ordering in each shard as a delay-oriented transaction processing problem and propose a Transaction Delay Optimization algorithm(TDO). Theoretical analysis proves that TDO is an approximation algorithm for the transaction packaging ordering problem with the approximation ratio of (Formula presented) , given block capacity C and maximum transaction size Smax. We conduct experiments through simulations. Simulation results show that TDO can effectively provide QoS to users and maximize the profits of miners. © 2013 IEEE.

关键词： Labels

来源：评论

学校读者我要写书评

暂无评论

A Power Control Scheme for Target Localization in WSN

引用

电子学报(英文版) 2008年第3期17卷 443-448页

作者： GU Yu ZHAO Baohua Department of Computer Science University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

In this paper, we focus on the target tracking problem in sensor networks and propose an Powersaving target localization scheme (PSTL) based on a conjecture model that reflects the moving pattern of a target, and also a corresponding two-step communication protocol between Base station (BS) and sensors. BS executes a query mechanism to determine which sensors should be used for detailed information according to a limited amount of data received from sensors. This scheme reduces both energy consumption and communication bandwidth requirement, prolongs the lifetime of the wireless sensor networks. Simulation results indicate that it can achieve a high accuracy while saving a large amount of energy.

关键词：无线传感器网络功率控制目标定位推测模型

来源：评论

学校读者我要写书评

暂无评论

ISLS: IoT-Based Smart Lighting System for Improving Energy Conservation in Office Buildings

arXiv

引用

arXiv 2025年

作者： Obioma, Peace Agbodike, Obinna Chen, Jenhui Wang, Lei Department of Computer Science University of Manchester M139PL United Kingdom Center for Artificial Intelligence in Medicine Chang Gung Memorial Hospital Guishan Dist Taoyuan33375 Taiwan iTrustal Department of Computer Science and Information Engineering Chang Gung University Guishan Dist. Taoyuan33302 Taiwan Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology China

With the Internet of Things (IoT) fostering seamless device-to-human and device-to-device interactions, the domain of intelligent lighting systems have evolved beyond simple occupancy and daylight sensing towards autonomous monitoring and control of power consumption and illuminance levels. To this regard, this paper proposes a new do-it-yourself (DIY) IoT-based method of smart lighting system featuring an illuminance control algorithm. The design involves the integration of occupancy and presence sensors alongside a communication module, to enable real-time wireless interaction and remote monitoring of the system parameters from any location through an end-user application. A constrained optimization problem was formulated to determine the optimal dimming vector for achieving target illuminance at minimal power consumption. The simplex algorithm was used to solve this problem, and the system’s performance was validated through both MATLAB simulations and real-world prototype testing in an indoor office environment. The obtained experimental results demonstrate substantial power savings across multiple user occupancy scenarios, achieving reductions of approx. 80%, 48%, and 26% for one, two, and four user settings, respectively, in comparison to traditional basic lighting installation systems. © 2025, CC BY.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Minimum-Energy Broadcast Trees in All-Wireless Networks

引用

电子学报(英文版) 2008年第2期17卷 227-230页

作者： HU Tian ZHAO Baohua Department of Computer Science University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

This paper focuses on the problem of constructing the minimum-energy broadcast trees in all-wireless networks. We proposed a greedy algorithm called Greedy maximum-branch replacement algorithm (GMBR) to decrease the total power of the broadcast tree further. This algorithm can be developed to a distributed one easily. Compared with the previous algorithms, GMBR was proved to have better performance, especially when the propagation loss exponent and the network size become larger.

关键词：最小能量广播天线网络技术性能

来源：评论

学校读者我要写书评

暂无评论

Compromising Rechargeable Sensor Networks in Marine Environment

引用

IEEE Transactions on Mobile Computing 2025年

作者： Wang, Qiwei Lin, Chi Dai, Haipeng Obaidat, Mohammad S. Hsiao, Kuei-Fang Fan, Xin Dalian University of Technology School of Software Technology & DUT-RU International School of Information Science and Engineering China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116620 China Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China SRM University Department of Computational Intelligence School of Computing SRM Nagar TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India The King Abdullah II School of Information Technology The University of Jordan Amman11942 Jordan

Marine Wireless Rechargeable Sensor Networks (MWRSNs), enhanced by recent Wireless Power Transfer (WPT) technology, present a significant advancement in extending network life. Traditional methods improve network performance through algorithm optimization, but neglect charging security, exposing networks to potential attacks. This paper addresses this problem from an adversarial view and develops a novel attack for MWRSN through Denying of Charge (DoC) to maximize network destructiveness. We start by establishing a generalized on-demand charging model, essential for developing DoC tactics. Subsequently, we unveil the Collaborative DoC (CoDoC) algorithm, capable of manipulating and falsifying charging requests. Central to CoDoC is the Request Prediction Method (RPM), which forecasts the initiation of charging requests and facilitates rapid request surges to enhance the attack's efficacy. CoDoC is able to disguise the presence of the attack, which is able to escape from being detected by the base station. Theoretical analyses are provided to explore the features of the proposed scheme. To demonstrate the outperformed features of the proposed schemes, extensive simulations and test-bed experiments are conducted. Our analysis and extensive simulations demonstrate that CoDoC increases sensor node failures by 20% to 142% compared to traditional methods, highlighting its effectiveness in marine environments. © 2002-2012 IEEE.

关键词： Charging stations

来源：评论

学校读者我要写书评

暂无评论

Secure Two-Party Point-Circle Inclusion Problem

引用

Journal of computer Science & Technology 2007年第1期22卷 88-91页

作者：罗永龙黄刘生仲红 Department of Computer Science University of Science and Technology of China Hefei 230027 China Department of Computer Science Anhui Normal University Wuhu 241000 China Anhui Province Key laboratory of Software in Computing and Communication Hefei 230027 China

Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly.

关键词： secure multi-party computation computational geometry homomorphic encryption scheme private comparison

来源：评论

学校读者我要写书评

暂无评论

LDMA-NOMA Beamforming in Near-field communication Systems

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Rao, Chenguang Ding, Zhiguo Cumanan, Kanapathippillai Dai, Xuchu University of Science and Technology of China CAS Key Laboratory of Wireless-Optical Communications Anhui Province Hefei230026 China Khalifa University Department of Electrical Engineering and Computer Science Abu Dhabi United Arab Emirates University of York School of Physics Engineering and Technology YorkYO10 5DD United Kingdom

In this paper, a novel LDMA-NOMA hybrid beamforming scheme is proposed for near-field communication systems, which improves the performance of both location-division multiple access (LDMA) and non-orthogonal multiple access (NOMA), simultaneously. The key innovation of the proposed scheme is the flexible utilization of user resolution information: LDMA is applied to users with better resolution, while NOMA is used for those users with poor resolution. For each NOMA user, the most suitable beam will be selected by optimizing the system performance and beam efficiency. A unique feature of our scheme is its effectiveness even under limited beam resources. The performance of the scheme is analyzed and the closed-form results are obtained. Simulation results validate the theoretical results and demonstrate superior performance compared to that of the conventional schemes. © 1967-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Classifying and clustering in negative databases

引用

Frontiers of computer Science 2013年第6期7卷 864-874页

作者： Ran LIU Wenjian LUO Lihua YUE School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor （kNN） classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novel method for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.

关键词： negative databases classification clustering k nearest neighbor k-means hamming distance

来源：评论

学校读者我要写书评

暂无评论

Nonlinear characteristics and qualitative analysis of sleep EEG

Nonlinear characteristics and qualitative analysis of sleep ...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Shao, Chenxi Fan, Jinfeng Li, Shaobin Department of Computer Science and Technology USTC Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China Department of Computer Science and Technology USTC Hefei Anhui 230027 China

ISBN: (纸本)1424411203

Correlation dimension (CD) and the largest Lyapunov exponent (LLE), which are two most important nonlinear invariant measures of nonlinear system, are adopted to characterize the complexity and stability of human brain during all sleep stages. In order to And an optimal embedding to reconstruct phase space, the C-C method and Cao's algorithm were thoroughly analyzed and implemented in efficient ways. Additionally, the G-P algorithm and Kantz's algorithm are also implemented for calculation of CD and LLE respectively. Eight normal sleep EEG records are acquired from MIT-BIH sleep-EDF database for this study. The values of CD and LLE for 30s epochs are calculated, and their mean and standard deviation values are evaluated as well. The results indicate that CD and LLE decrease from the waking stage to stages I, II and III-IV, and they have large values during rapid eye movement (REM) sleep stage. Then, a qualitative conclusion may be drawn that during waking stage and REM sleep stage, brain activity has higher complexity and lower stability than during other stages. © 2007 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：