학술논문

Constraint-Driven Type-2 Fuzzy C-Means Clustering and Step-Wise Gossip for Fusion Transmission in Distributed Networks
Document Type
Periodical
Source
IEEE Communications Letters IEEE Commun. Lett. Communications Letters, IEEE. 28(5):1226-1230 May, 2024
Subject
Communication, Networking and Broadcast Technologies
Clustering algorithms
Linear programming
Peer-to-peer computing
Energy states
Protocols
Fuzzy sets
Fault tolerant systems
Gossip algorithm
communication protocol
information dissemination
type-2 fuzzy C-Means
transition state theory
Language
ISSN
1089-7798
1558-2558
2373-7891
Abstract
The Gossip algorithm is an important communication protocol that can be used in various fields, including computer networks and distributed systems. This letter proposes an integrated approach that combines Constraint-Driven Type-2 Fuzzy C-Means (T2FCM) clustering and the step-wise gossip algorithm to overcome the challenges of communication congestion in peer-to-peer distributed networks. Traditional clustering algorithms often lack accuracy and relevance in organizing and analyzing large volumes of data in nodes. To address this, the integration of T2FCM clustering, which incorporates domain-specific constraints, is introduced to improve clustering accuracy. Additionally, the transition state theory based step-wise gossip algorithm is utilized to adjust information transfer rates, enhancing scalability, fault tolerance, and resource utilization while reducing communication congestion. Simulation results demonstrate the effectiveness of the proposed approach in achieving low latency access. By leveraging accurate clustering results and adjusting information transfer rates, the overall performance of fusion transmission in peer-to-peer networks is significantly improved.