Improved algorithms for leader election in distributed systems

Effatparvar, Mehdi; Yazdani, Nasser; Dadlani, Aresh; Khonsari, Ahmad

doi:10.1109/iccet.2010.5485357

Cited by 30 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In which the raw data set D is finally partitioned into three subsets, D event , D error and D ordinary . The clustering is done using incremental algorithm, Cluster head is selected using the peterson's algorithm [8]. Cluster heads are scheduled to rotate themselves with the period of time based on the energy level of the nodes (Residual energy).…”

Section: Methodsmentioning

confidence: 99%

Improved Data Discrimination in Wireless Sensor Networks

Sabarish¹,

Shanmugapriya²

2012

WSN

View full text Add to dashboard Cite

In Wireless Sensors Networks, the computational power and storage capacity is limited. Wireless Sensor Networks are operated in low power batteries, mostly not rechargeable. The amount of data processed is incremental in nature, due to deployment of various applications in Wireless Sensor Networks, thereby leading to high power consumption in the network. For effectively processing the data and reducing the power consumption the discrimination of noisy, redundant and outlier data has to be performed. In this paper we focus on data discrimination done at node and cluster level employing Data Mining Techniques. We propose an algorithm to collect data values both at node and cluster level and finding the principal component using PCA techniques and removing outliers resulting in error free data. Finally a comparison is made with the Statistical and Bucket-width outlier detection algorithm where the efficiency is improved to an extent.

show abstract

Section: Methodsmentioning

confidence: 99%

Improved Data Discrimination in Wireless Sensor Networks

Sabarish¹,

Shanmugapriya²

2012

WSN

View full text Add to dashboard Cite

show abstract

“…These assumptions are not realistic in wireless sensor networks and they require additional complex algorithms to deal with this synchronization. In [7], another improved version of Bully's algorithm is described, which acquires a smaller number of transmissions for leader election but takes more time. During leader election, a node will compare its value with the received value and only transmit the greater one.…”

Section: Introduction and Related Workmentioning

confidence: 99%

LOGO: A New Distributed Leader Election Algorithm in WSNs with Low Energy Consumption

Bounceur

Bezoui

Noreen

et al. 2018

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

“…It is currently used for several distributed applications that require a high degree of consistency and availability such as distributed databases, distributed white board, collaborative applications, and distributed agenda. In this approach, one node acts as a single organizer (called the primary) for other nodes in the system [1][2][3][4] in the sense that it exclusively manages object consistency and transaction serialization as shown in Fig. 1.…”

Section: Introductionmentioning

confidence: 99%