A Genetic Based Leader Election Algorithm for IoT Cloud Data Processing

In IoT networks,nodes communicate with each other for computational services,data processing,and resource sharing.Most of the time huge data is generated at the network edge due to extensive communication between IoT devices.So,this tidal data is transferred to the cloud data center(CDC)for efficient processing and effective data storage.In CDC,leader nodes are responsible for higher performance,reliability,deadlock handling,reduced latency,and to provide cost-effective computational services to the users.However,the optimal leader selection is a computationally hard problem as several factors like memory,CPU MIPS,and bandwidth,etc.,are needed to be considered while selecting a leader amongst the set of available nodes.The existing approaches for leader selection are monolithic,as they identify the leader nodes without taking the optimal approach for leader resources.Therefore,for optimal leader node selection,a genetic algorithm(GA)based leader election(GLEA)approach is presented in this paper.The proposed GLEA uses the available resources to evaluate the candidate nodes during the leader election process.In the first phase of the algorithm,the cost of individual nodes,and overall cluster cost is computed on the bases of available resources.In the second phase,the best computational nodes are selected as the leader nodes by applying the genetic operations against a cost function by considering the available resources.The GLEA procedure is then compared against the Bees Life Algorithm(BLA).The experimental results show that the proposed scheme outperforms BLA in terms of execution time,SLA Violation,and their utilization with state-of-the-art schemes.

Eventual Leader Election with Weak Assumptions on Initial Knowledge,Communication Reliability,and Synchrony

This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash（t〈n,where n is the total number of processes）.It considers weak assumptions both on the initial knowledge of the processes and on the network behavior.More precisely,initially,a process knows only its identity and the fact that the process identities are different and totally ordered（it knows neither n nor t）.Two eventual leader election protocols and a lower bound are presented.The first protocol assumes that a process also knows a lower bound α on the number of processes that do not crash.This protocol requires the following behavioral properties from the underlying network：the graph made up of the correct processes and fair lossy links is strongly connected,and there is a correct process connected to（n〈f）-α other correct processes（where f is the actual number of crashes in the considered run） through eventually timely paths（paths made up of correct processes and eventually timely links）.This protocol is not communication-efficient in the sense that each correct process has to send messages forever.The second protocol is communication-efficient：after some time,only the final common leader has to send messages forever.This protocol does not require the processes to know α,but requires stronger properties from the underlying network：each pair of correct processes has to be connected by fair lossy links（one in each direction）,and there is a correct process whose n〈f-1 output links to the rest of correct processes have to be eventually timely.A matching lower bound result shows that any eventual leader election protocol must have runs with this number of eventually timely links,even if all processes know all the processes identities.In addition to being communication-efficient,the second protocol has another noteworthy efficiency property,namely,be the run finite or infinite,all the local variables and message fields have a finite domain in the run.

Probabilistic verification of hierarchical leader election protocol in dynamic systems

Leader election protocols are fundamental for coordination problems--such as consensus--in distributed computing. Recently, hierarchical leader election protocols have been proposed for dynamic systems where processes can dynamically join and leave, and no process has global information. However, quantitative analysis of such protocols is generally lacking. In this paper, we present a probabilistic model checking based approach to verify quantitative properties of these protocols. Particularly, we employ the compositional technique in the style of assume-guarantee reasoning such that the sub-protocols for each of the two layers are verified separately and the correctness of the whole protocol is guaranteed by the assume-guarantee rules. Moreover, within this framework we also augment the proposed model with additional features such as rewards. This allows the analysis of time or energy consumption of the protocol. Experiments have been conducted to demonstrate the effectiveness of our approach.

Distributed Coordinator Election Scheme for QoS Support and Seamless Connectivity in WPANs

Wireless personal area networks （WPANs） are formed in a relatively small area, and coordinator that serves as a central control device plays an important role in the operation and organization of a piconet. Typical applications of WPANs include home automation systems, security systems and health monitoring systems. In these types of systems, guaranteeing seamless connectivity is very important, and communications cannot take place when the coordinator malfunctions. Thus, in the case of a breakdown, it is necessary to elect a new coordinator as soon as possible. For this reason, a distributed coordinator election scheme （DCES） is proposed that considers not only QoS support but also network connectivity in an effort to avoid possible network partition. Simulation results show that the proposed scheme can elect a new coordinator while maintaining QoS and guaranteeing connectivity for a limited period.