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

Proposal and comparative analysis of a voting-based election algorithm for managing service replication in MANETs

APPLIED INTELLIGENCE 2023年第16期53卷 19563-19590页

作者： Guerrero-Contreras, Gabriel Balderas-Diaz, Sara Garrido, Jose Luis Rodriguez-Fortiz, Maria Jose O'Hare, Gregory M. P. Univ Cadiz Dept Comp Sci & Engn Avda Univ Cadiz 10 Puerto Real 11519 Cadiz Spain Univ Granada Comp Sci Sch Dept Software Engn C Periodista Daniel Saucedo Aranda S-N Granada 18014 Spain Trinity Coll Dublin Sch Comp Sci & Stat Coll Green Dublin 2 Dublin Ireland

Novel approaches are needed to better facilitate dynamic service replication management in mobile ad-hoc networks (MANETs) and to use and apply them within current and emerging autonomous intelligent systems and the Internet of Things (IoT) paradigm. Such approaches should address the context-awareness and self-adaptation of service replication, while paying special attention to quality attributes (e.g. availability, reliability, etc.) under specific runtime changes and adverse conditions with unstable communications and network partitions. The dynamic election for a node to host a service replica in MANETs can be based on the use of leader election (LE) algorithms. In this research work, a new voting-based election algorithm for managing dynamic service replication in MANETs (namely, VOELA) is proposed. This algorithm is based upon a utility function to score node resources and features (i.e., battery level and topology position) to decide where the service replica will be activated. VOELA is compared to a previously proposed consensus-based algorithm and three other well-known leader election algorithms in terms of service availability, election algorithm reliability, coordination message usage, and network lifetime. For this comparative analysis, the ns-3 network simulator is used together with three different mobility models, namely Manhattan Grid Mobility (MGM), Random Walk Mobility (RWM) and Reference Point Group Mobility (RPGM). The VOELA algorithm demonstrates in balance the most promising results.

关键词： Leader election (LE) election algorithm Availability Reliability MANETs Network lifetime

来源：评论

学校读者我要写书评

暂无评论

FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems

引用

JOURNAL OF SUPERCOMPUTING 2021年第1期77卷 751-779页

作者： Biswas, Amit Maurya, Ashish Kumar Tripathi, Anil Kumar Aknine, Samir Indian Inst Technol BHU Dept Comp Sci & Engn Varanasi Uttar Pradesh India Motilal Nehru Natl Inst Technol Allahabad Dept Comp Sci & Engn Prayagraj India Univ Claude Bernard Lyon 1 LIRIS Lab Lyon 1 France

In a distributed system, multiple nodes work together to build a highly available, reliable, resource shareable, and fault-tolerant system to achieve a common goal. Here, multiple nodes work together to complete a task, so coordination is essential among these nodes. Electing a node as a system leader from among all the nodes can be a possible solution to do the coordination. Besides coordination, the leader also controls various activities like task allocation, result aggregation, efficient resource sharing, clock synchronization, and communication among the nodes of the system. In this work, we address the leader election problem through a new leader election algorithm called Failure Rate and Load-based Leader election (FRLLE) algorithm for bidirectional ring networks. The proposed algorithm elects a node with a minimum failure rate and load as well so that the system gets a more reliable leader that can concentrate on leadership roles and activity comfortably. Like a proper leader election algorithm, this algorithm satisfies safety, liveness, and termination conditions that help to build an efficient and consistent distributed system. This algorithm reduces the message and time complexity, which means the algorithm takes fewer time steps to elect a leader by exchanging fewer messages. We compare the simulation results of the FRLLE algorithm with the well-known existing leader election algorithms and demonstrate that the FRLLE algorithm exchanges fewer messages and takes fewer time steps to elect the leader. We further carried out a priori complexity analysis and compared the outcome with the results of the simulation to corroborate our proposal.

关键词： Leader election election algorithm Distributed systems Propagation delay Failure rate Complexity analysis

来源：评论

学校读者我要写书评

暂无评论

CHAOTIC election algorithm

引用

COMPUTING AND INFORMATICS 2019年第6期38卷 1444-1478页

作者： Emami, Hojjat Univ Bonab Comp Engn Dept Bonab East Azerbaijan Iran

A novel Chaotic election algorithm (CEA) is presented for numerical function optimization. CEA is a powerful enhancement of election algorithm. The election algorithm is a socio-politically inspired strategy that mimics the behavior of candidates and voters in presidential election process. In election algorithm, individuals are organized as electoral parties. Advertising campaign forms the basis of the algorithm in which individuals interact or compete with one other using three operators: positive advertisement, negative advertisement and coalition. Advertising campaign hopefully causes the individuals converge to the global optimum point in solution space. However, election algorithm suffers from a fundamental challenge: it gets stuck at local optima due to the inability of advertising campaign in searching solution space. CEA enhances the election algorithm through modifying party formation step, introducing chaotic positive advertisement and migration operator. By chaotic positive advertisement, CEA exploits the entire solution space, what increases the probability of obtaining global optimum point. By migration, CEA increases the diversity of the population and prevents early convergence of the individuals. The proposed CEA algorithm is tested on 28 well-known standard boundary-constrained test functions, and the results are verified by a comparative study with several well-known meta-heuristics. The results demonstrate that CEA is able to provide significant improvement over canonical election algorithm and other comparable algorithms.

关键词： Optimization meta-heuristic election algorithm Chaotic election algorithm (CEA)

来源：评论

学校读者我要写书评

暂无评论

A Timer Based Leader election algorithm 13

A Timer Based Leader Election Algorithm

引用

Conference on UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld

作者： Biswas, Amit Dutta, Animesh NIT Durgapur Dept IT Durgapur India

ISBN: (纸本)9781509027712

This paper addresses a problem of Leader election in a distributed system. Basically Leader election algorithms choose a process or node among the number of processes or nodes as a Coordinator to manage the use of shared resources in an optimal manner and construct the fault-tolerant distributed systems. A good leader election algorithm should take less time and less message passing to elect a leader or Coordinator. In this paper, we introduce a timer based new leader election algorithm which is somehow or order beneficial than the existing leader election algorithms. The higher efficiency and better performance of our proposed algorithm with respect to the existing algorithms is validated through the complexity Analysis of the algorithms.

关键词： Leader election election algorithm Time complexity Message complexity Distributed systems

来源：评论

学校读者我要写书评

暂无评论

election algorithm: A new socio-politically inspired strategy

引用

AI COMMUNICATIONS 2015年第3期28卷 591-603页

作者： Emami, Hojjat Derakhshan, Farnaz Islamic Azad Univ Miandoab Branch Dept Comp Engn Miandoab Iran Univ Tabriz Fac Elect & Comp Engn Tabriz Iran

This paper describes election algorithm (EA), an optimization and search technique, inspired by presidential election. The EA is an iterative population based algorithm, which works with a set of solutions known as population. Each individual of the population is called a person and can be either a candidate or a voter. These persons form a number of electoral parties in the solution space. Advertising campaign is the core of this algorithm and contains three main steps: positive advertisement, negative advertisement and coalition. During positive advertisement, the candidates introduce themselves through reinforcing their positive images and qualities. In the negative advertisement, candidates compete with each other to increase their popularity and defame their opponents. Also in some cases, the candidates that have similar ideas can confederate together in order to increase the chance of success of the united party. Advertisements hopefully cause the persons to converge to a state of solution space that is the global optimum. All these efforts lead up to election day (stopping condition). On election day, the candidate who attained the most votes, is announced as the winner and equals to the best solution that is found for the problem. In order to evaluate the performance of EA, we compared this algorithm with Continuous Genetic algorithm (CGA), Comprehensive Learning Particle Swarm Optimizer (CLPSO), Adaptive Differential Evolution algorithm (JDE) and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in finding the global optimum of four mathematical benchmark examples. Our experiments demonstrate the superiority of the EA for benchmark examples.

关键词： election algorithm global optimization meta-heuristic algorithms presidential election

来源：评论

学校读者我要写书评

暂无评论

Research on the Application of Distributed Intrusion Detection System Based on election algorithm 1

Research on the Application of Distributed Intrusion Detecti...

引用

1st International Conference on Human Centered Computing (HCC)

作者： Wang, Wuqi Yang, Zhi-min Peng, Gong Anhui Wonder Univ Informat Engn Hefei Anhui Peoples R China Shangdong Vocat Coll Foreign Affairs Translat Weihai Shandong Peoples R China

ISBN: (纸本)9783319155548;9783319155531

Distributed intrusion detection system, as a kind of important security defense technology, is widely used in all kinds of information network system. In this thesis, the detection overhead host node values are determined by application of exponential scale method, through the qualitative judgment and quantitative calculation. A distributed election algorithm is also proposed, master control center elected by the actual cost of the value of nodes, which greatly improve the overall defense capability of intrusion detection system. The main control center of the election can optimizer such key factors as reliabilities of current network bandwidth, link and detection subsystem performance at real-time, and make the system resources obtain the reasonable use, and greatly improve the overall defense capability of intrusion detection system.

关键词： Exponential scale method The master control center election algorithm

来源：评论

学校读者我要写书评

暂无评论

New optimization methods for designing rain stations network using new neural network, election, and whale optimization algorithms by combining the Kriging method

引用

ENVIRONMENTAL MONITORING AND ASSESSMENT 2021年第1期193卷 1-16页

作者： Safavi, Maryam Siuki, Abbas Khashei Hashemi, Seyed Reza Univ Birjand Engn Dept Birjand Iran

In many studies of water and hydrological sources, estimation of the spatial distribution of precipitation based on point data recorded in rain gauge stations is of particular importance. The purpose of this paper is to optimize the network of rain gauge stations in the Sistan and Baluchestan Province with respect to the variance of Kriging and topography estimation in the region and to maintain or reduce the number of stations in the region (without incurring additional costs). A new neural network algorithm has been presented in the present study to determine the optimum rain gauge stations. In this study, a new method of meta-heuristic optimization algorithm based on biological neural systems and artificial neural networks (ANNs) has been proposed. The proposed method is called a neural network algorithm (NNA) and has been developed based on unique structure (ANNs). In order to evaluate the proposed method, the election and whale algorithms have been used. The election algorithm is a repetitive algorithm that works with a set of known solutions as a population, and the whale optimization algorithm is derived from the new nature based on the special bubble hunting strategy used by the vultures. The results showed that 22 stations of the existing network had no significant effect on rainfall estimation in the province and their removal to the optimal network is suggested. Therefore, the remaining 27 stations can be effective in optimizing the rain gauge network. The results of comparing the abovementioned algorithms showed that the neural network algorithm with a mean error of 0.06 mm has a higher ability to optimize the rain gauges than blue whale and election algorithms.

关键词： Neural network algorithm election algorithm Rain gauge network monitoring Sistan and Baluchestan

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based random auditor committee for integrity verification

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2022年 131卷 183-193页

作者： Chen, Lanxiang Fu, Qingxiao Mu, Yi Zeng, Lingfang Rezaeibagha, Fatemeh Hwang, Min-Shiang Fujian Normal Univ Coll Comp & Cyber Secur Fujian Prov Key Lab Network Secur & Cryptol Fuzhou Peoples R China City Univ Macau Inst Data Sci Macau Peoples R China Zhejiang Lab Hangzhou Peoples R China Murdoch Univ Discipline Informat Technol Perth WA Australia Asia Univ Dept Comp Sci & Informat Engn Taichung Taiwan

With the popularity of cloud storage, integrity verification for outsourced data has attracted more and more attention. The majority of existing research works rely on a unique third-party auditor (TPA) or fixed TPAs to audit the integrity of outsourced data, and thus they are vulnerable to DoS and collusion attacks as the TPA is not completely trusted. To conquer this problem, a blockchain-based random auditor committee is proposed to replace the fixed TPAs for the integrity verification (call BRAC scheme for short). The proposed blockchain consensus algorithm utilizes a verifiable random function (VRF) to select the third-party auditor committee (TPAC) which performs contract verification. The leader of TPAs (LTPA) packs the verification proof into a blockchain called verification chain. The main idea is employing the output of a VRF for leader election to make it probabilistic, such that specific nodes cannot be targeted in advance and a certain fraction of the nodes being malicious can be tolerated. We present rigorous security analysis to demonstrate the security of the proposed scheme. Meanwhile, the comprehensive performance evaluation shows that the proposed scheme improves the performance of data integrity verification effectively. (c) 2022 Elsevier B.V. All rights reserved.

关键词： Cloud storage Integrity verification Random auditor committee election algorithm Blockchain

来源：评论

学校读者我要写书评

暂无评论

Optimal Design of Groundwater Monitoring Network Using the Combined election-Kriging Method

引用

WATER RESOURCES MANAGEMENT 2020年第8期34卷 2503-2516页

作者： Kavusi, Mohadeseh Siuki, Abbas Khashei Dastourani, Mahdi Univ Birjand Dept Sci & Water Engn Birjand Iran

Groundwater monitoring requires a great deal of cost and time that optimizing the quantitative groundwater monitoring network with selecting the optimal number of sampling wells and determining their optimal location for reducing the cost and time of quantitative groundwater assessment are necessary. The data from 110 observation wells of Neyshabur plain in Iran range from the year 1986 to 2016 were studied. The combined election-Kriging method was used to analyze these data, and the Pareto chart was plotted to determine the optimal number and location in two scenarios. The first scenario was to determine the optimal wells location among the existing wells and the second scenario was to determine the optimal wells location for monitoring groundwater levels throughout the plain. To limit the search space, the maximum and minimum number of monitoring network wells were selected 30 and 85 respectively. Based on the results, the selected method accurately provided the appropriate location of wells, so that in the first scenario, the RMSE values for the number of wells were in the range of 0.71 to 2.34 m. which are acceptable. In the second scenario, the RMSE values of between 1.04 and 2.89 m were obtained, which are appropriate values according to the objective of the problem. Also, the distribution of the wells selected in the area is also uniform in most numbers according to the second scenario, which indicates the good accuracy of the method.

关键词： Groundwater Monitoring Network election algorithm Kriging Neyshabur Plain

来源：评论

学校读者我要写书评

暂无评论

Multi-Party Quantum Key Distribution Protocol with New Bell States Encoding Mode

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2021年第4期60卷 1328-1338页

作者： Ma, Xiyuan Wang, Chaonan Li, Zexi Zhu, Hongfeng Liaocheng Univ Dongchang Coll Dept Math & Informat Engn 105 Huanghe Rd Liaocheng 252000 Shandong Peoples R China Shenyang Normal Univ Software Coll 253 HuangHe Bei St Shenyang 110034 Liaoning Peoples R China

Security, efficiency and universality are the major concerns in distributed computation for how to communicate securely as there are a large number of nodes that require interactive authentication. These become more challenging especially for the multi-party quantum environment as it is highly complicated and heterogeneous in nature. Hence, based on bell states and unitary operation, we propose a multi-party quantum group key distribution protocol. The initial two participants are generated by election algorithm to ensure the fairness among the participants in our protocol. Next, mutual authentication is provided by two Bell states of four orthogonal maximal states, and the group session key is obtained by combining unitary operation. The main innovations of this scheme are that the authenticated information with the group key is transmitted among the ordered participants, and the efficiency of our protocol is acceptable which the time complexity of QKD is O([log(2)(N)])effectively resist internal attacks and external attacks, and has feasible efficiency.

关键词： Quantum key distribution Mutual authentication Bell state election algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：