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

Determining Distributions of Security Means for WSNs Based on the Model of a Neighborhood Watch

IEEE ACCESS 2024年 12卷 74343-74366页

作者： Foerster, Benjamin Langendoerfer, Peter Hinze, Thomas Wireless Syst Innovat High Performance Microelect D-15236 Frankfurt Germany Friedrich Schiller Univ Jena Fac Biol Sci D-07743 Jena Germany

Neighbourhood watch is a concept allowing a community to distribute a complex security task in between all members. Members carry out security tasks in a distributed and cooperative manner ensuring their mutual security and reducing the individual workload while increasing the overall security of the community. Wireless sensor networks (WSNs) are composed of resource-constraint independent battery driven computers as nodes communicating wirelessly. Security in WSNs is essential to prevent attackers from eavesdropping, tampering monitoring results or denying critical nodes from providing their services and potentially cutting off larger network parts. The resource-constraint nature of sensor nodes prevents them from running full-fledged security protocols. Instead, it is necessary to assess the most significant security threats and implement specialised security solutions. A neighbourhood watch inspired distributed security scheme for WSNs has been introduced by Langend & ouml;rfer aiming to increase the variety of attacks a WSN can fend off. The framework intends to statically distribute requirement-based selections of online security means intended to cooperate in close proximity on large-scale static homogeneous WSNs. A framework of such complexity has to be designed in multiple steps. We determine suitable distributions of security means based on graph partitioning concepts. The partitioning algorithms we provide are NP-hard. To evaluate their computability, we implement them as 0 - 1 linear programs (LPs) and test them on WSN models generated with our novel lambda -precision unit disk graph (UDG) generator.

关键词： Security Wireless sensor networks Generators Task analysis Collaboration Computational modeling Optimization Cooperative systems distributed computing Cooperative security framework distributed security means graph generator linear programming neighbourhood watch unit disk graphs wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

MODIFYING THE ASYNCHRONOUS JACOBI METHOD FOR DATA CORRUPTION RESILIENCE

引用

SIAM JOURNAL ON SCIENTIFIC computing 2024年第5期46卷 A3258-A3281页

作者： Vogl, Christopher J. Atkins, Zachary R. Fox, Alyson Miedlar, Agnieszka Ponce, Colin Lawrence Livermore Natl Lab Livermore CA 94550 USA Univ Colorado Dept Comp Sci Boulder CO 80309 USA Virginia Tech Dept Math Blacksburg VA 24060 USA

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

关键词： distributed computing asynchronous methods Jacobi data corruption

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Critical Path of distributed Dataflow Graph Algorithms

Optimizing the Critical Path of Distributed Dataflow Graph A...

引用

37th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Durrman, Dante Saule, Erik UNC Charlotte Dept Math Charlotte NC 28223 USA UNC Charlotte Dept Comp Sci Charlotte NC 28223 USA

ISBN: (纸本)9798350311990

Executing graph algorithms in a parallel or distributed context is a challenging problem. Solving race conditions with locks is usually prohibitively expensive and some algorithms opt for a strategy that ignores the race condition altogether and corrects later the derived solution if it is invalid. Alternatively, dataflow algorithms solve the synchronization problem by executing the algorithm by following a partial order on the graph. While removing the cost of locks or avoiding a checking phase improves performance, it is possible that the algorithm picks a partial order with long chains, which limit parallelism. In this paper, we investigate how distributed dataflow graph algorithm obtain a partial order and how one could favor orders with shorter long chains. Most dataflow algorithms obtain their order by having each vertex of the graph pick a uniformly random number in [0;1) and order the vertices based on that number. We believe that this type of order could lead to long chains in graphs with dense regions such as small world graph. We design two alternative ways of generating the order to make it similar to a largest degree first order. We study the behavior of these different algorithms on a wide range of randomly generated RMAT graphs and on a set of real world graphs. And we show that our ordering methods can significantly reduce the length of the longest chain.

关键词： graph analysis distributed computing partial order interval coloring randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Geospatial Services Deployment: An Experimental Benchmark Analysis

引用

JOURNAL OF GRID computing 2025年第2期23卷 1-17页

作者： Franchi, Fabio Smarra, Francesco Di Fina, Eleonora Galassi, Alessandra Univ Aquila Dept Informat Engn Comp Sci & Math Via Vetoio I-67100 Laquila AQ Italy Univ Aquila Dept Civil Architecture & Environm Engn Piazzale E Pontieri I-67100 Laquila AQ Italy Fdn Ugo Bordoni Viale Policlin 147 I-00161 Rome RM Italy

In the rapid evolution of digitization, geoservices such as Geographical Information Systems are re-emerging as a design tool for innovation, change, and policy development, while traditional databases struggle to handle geodata. Scaling these services can be complex, time-consuming, and computationally intensive. Relying on cloud-based solutions, there is a lack of knowledge about (geo-)database performance in the cluster environment Kubernetes, an open-source orchestrator designed to simplify the deployment, scalability, and operation of containerized applications. However, the integration of geoservices into cloud-edge technologies presents challenges in task scheduling and service placement, thus requiring new management strategies. In this respect, distributed computing offers opportunities, but may introduce network delays that degrade the Quality of Service;such latency is minimized by Multi-access Edge computing standard technology. This research work presents an experimental comparative analysis for PostgreSQL/PostGIS relational database geoservices operating in a cluster versus non-cluster environment, focusing on the data management layer. Performance evaluation refers to the average execution times of SQL operations and the PostGIS function under different hardware conditions. With the combination of Kubernetes and Docker, the clustered environment showed improvements in the average execution time of resource-intensive (geo-)queries on all hardware reference setups, outperforming the non-clustered counterparts.

关键词： GIS Geoservices distributed computing Service orchestration Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Research on distributed computing of EAI Platform System 11

Research on Distributed Computing of EAI Platform System

引用

11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Tao, Jun Jianghan Univ Sch Math & Comp Sci Wuhan Hubei Peoples R China

ISBN: (纸本)9781479951482

distributed computing, a paradigm often used for building business applications, enables a task to be performed by combining the efforts of multiple processes. The processes can be running at different locations, and on different types of computers. This paper gives an overview on the distributed computing problem in an integrated application environment. Based on this problem description, it gives out the EAI Platform distributed computing Solution. To this end, it designs a platform system for enterprise applications integration. EAI Platform provides an infrastructure for communication and control among diverse, distributed applications. The EAI Platform framework supports applications that use distributed, client-server communications, in both Java and C++.

关键词： distributed computing EAI Platform-Specific Metadata Access Control

来源：评论

学校读者我要写书评

暂无评论

The integration strategy of information system based on artificial intelligence big data technology in metaverse environment

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第5期27卷 7049-7057页

作者： Lin, Yechuan Liu, Shixing Liaodong Univ Network & Informatizat Ctr Dandong 118000 Liaoning Peoples R China Liaoning Univ Coll Phys Shenyang 110036 Liaoning Peoples R China

The concept of the meta-universe is still in its early stages, but many leading tech companies have invested heavily in research and development for this technology. The development of meta-smart cities is a significant trend. In the meta-universe environment, integrating information systems is crucial for analyzing AI big data. Establishing an integrated platform for medical information systems is key to advancing information technology. In the context of the meta-universe, creating an efficient and unified integration platform to eliminate medical information silos and reduce system integration costs has become a pressing issue in medical informatization. This paper proposes a medical information system integration method based on an integration platform and utilizing cloud computing technology as a data center. The core business layer uses the integration software "Ensemble" as the integration platform. The underlying data center employs a Hadoop storage cluster with distributed data storage and parallel computing technology, and the existing scheduling algorithm is studied and analyzed to enhance the resource scheduling algorithm for medical small file data. The effectiveness of the algorithm is simulated and verified on an experimental platform, demonstrating improved efficiency in resource scheduling.

关键词： Metaverse Big data Healthcare information system integration Hadoop distributed computing

来源：评论

学校读者我要写书评

暂无评论

Four node graphlet and triad enumeration on distributed platforms

引用

distributed AND PARALLEL DATABASES 2022年第2-3期40卷 335-372页

作者： Santoso, Yudi Liu, Xiaozhou Srinivasan, Venkatesh Thomo, Alex Univ Victoria Dept Comp Sci Victoria BC Canada

Graphlet enumeration is a basic task in graph analysis with many applications. Thus it is important to be able to perform this task within a reasonable amount of time. However, this objective is challenging when the input graph is very large, with millions of nodes and edges. Known solutions are limited in terms of the scale of the graph that they can process. distributed computing is often proposed as a solution to improve the maximum scale. However, it has to be done carefully to reduce the overhead cost and to really benefit from the distributed solution. We study the enumeration of four-node graphlets in undirected graphs and triads in directed graphs using a distributed platform. We propose an efficient distributed solution that significantly surpasses the existing solutions on the scale and performance. With this method, we are able to process larger graphs that have never been processed before and enumerate quadrillions of graphlets using a modest cluster of machines. Our experimental results show that our solution has a strong machine scalability close to one.

关键词： distributed computing Graph mining Massive networks Subgraph enumeration

来源：评论

学校读者我要写书评

暂无评论

DE-RALBA: dynamic enhanced resource aware load balancing algorithm for cloud computing

引用

PEERJ COMPUTER SCIENCE 2025年 11卷 e2739-e2739页

作者： Hussain, Altaf Aleem, Muhammad Rehman, Atiq Ur Arshad, Umer Inst Space Technol Dept Comp Sci KICSIT Campus Islamabad Pakistan Coventry Univ Sch Comp Math & Data Sci London England Univ Cent Punjab UCP Fac Informat Technol Dept Comp Sci Lahore Pakistan

Cloud computing provides an opportunity to gain access to the large-scale and high-speed resources without establishing your own computing infrastructure for executing the high-performance computing (HPC) applications. Cloud has the computing resources (i.e., computation power, storage, operating system, network, and database etc.) as a public utility and provides services to the end users on a pay-as-you-go model. From past several years, the efficient utilization of resources on a compute cloud has become a prime interest for the scientific community. One of the key reasons behind inefficient resource utilization is the imbalance distribution of workload while executing the HPC applications in a heterogenous computing environment. The static scheduling technique usually produces lower resource utilization and higher makespan, while the dynamic scheduling achieves better resource utilization and load-balancing by incorporating a dynamic resource pool. The dynamic techniques lead to increased overhead by requiring a continuous system monitoring, job requirement assessments and real-time allocation decisions. This additional load has the potential to impact the performance and responsiveness on computing system. In this article, a dynamic enhanced resource-aware load balancing algorithm (DE-RALBA) is proposed to mitigate the load-imbalance in job scheduling by considering the computing capabilities of all VMs in cloud computing. The empirical assessments are performed on CloudSim simulator using instances of two scientific benchmark datasets (i.e., heterogeneous computing scheduling problems (HCSP) instances and Google Cloud Jobs (GoCJ) dataset). The obtained results revealed that the DE-RALBA mitigates the load imbalance and provides a significant improvement in terms of makespan and resource utilization against existing algorithms, namely PSSLB, PSSELB, Dynamic MaxMin, and DRALBA. Using HCSP instances, the DE-RALBA algorithm achieves up to 52.35% improved resources

关键词： Cloud computing Load balancing Scheduling algorithm Resource-aware scheduling Resource-aware load balancing Dynamic scheduling Dynamic load balancing distributed computing DE-RALBA

来源：评论

学校读者我要写书评

暂无评论

Bringing CS2013 Recommendations for Parallel and distributed computing Into Your CS Curriculum 14

Bringing CS2013 Recommendations for Parallel and Distributed...

引用

45th ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Brown, Richard Shoop, Elizabeth Adams, Joel St Olaf Coll Northfield MN 55057 USA Macalester Coll St Paul MN 55105 USA Calvin Coll Grand Rapids MI 49506 USA

ISBN: (纸本)9781450326056

The ACM-IEEE CS2013 curricular recommendations include a dramatic growth in parallel and distributed computing (PDC) topics, in response to the necessary industry shift toward multicore computing, and to emerging technologies such as cloud computing. How can your institution integrate those recommendations into your undergraduate CS curriculum? In this special session, leaders in PDC education will succinctly present their curricular strategies in relation to CS2013 recommendations, while attendees carry out a workshop-style activity to identify opportunities and assemble resources for blending more PDC content into their own local CS curricula.

关键词： Curriculum CS curriculum Parallelism distributed computing Parallelism and distributed computing PDC Curriculum planning CS major

来源：评论

学校读者我要写书评

暂无评论

Editorial: Introduction to the Issue on distributed Machine Learning for Wireless Communication

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2022年第3期16卷 320-325页

作者： Yang, Ping Dobre, Octavia A. Xiao, Ming Di Renzo, Marco Li, Jun Quek, Tony Q. S. Han, Zhu Univ Elect Sci & Technol China Chengdu 611731 Peoples R China Mem Univ Newfoundland St John NF A1B3C5 Canada Royal Inst Technol KTH Sch Elect Engn & Comp Sci Dept Informat Sci & Engn S-10044 Stockholm Sweden Univ Paris Saclay F-91190 Gif Sur Yvette France Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing 210094 Peoples R China Singapore Univ Technol & Design SUTD Singapore 487372 Singapore Univ Houston Houston TX 77004 USA

The papers in this special section focus on the use of distributed machine learning for wireless communications. With the emergence of new application scenarios (e.g., real-time and interactive services and Internet of Things) and the fast development of smart terminals, wireless data traffic has increased drastically, and the existing wireless networks cannot completely meet the technical requirements of the next generation mobile communication networks, e.g., 6G. In recent years, machine learning-based methods have been considered as potential technologies for 6G, because in wireless communication systems, key issues behind synchronization, channel estimation, signal detection, and iterative decoding can be solved by well-designed machine learning algorithms. Currently, most wireless network machine learning solutions require the training data and learning process to be centralized in one or more data centers. However, these centralized machine learning methods expose disadvantages, e.g., privacy security, significant signaling overhead, increased implementation complexity, and high latency, which limit their practicality. The wireless networks of the future must make quicker and more reliable decisions at the network edge.

关键词： Special issues and sections Machine learning Wireless networks distributed computing Signal processing Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：