Effective and Efficient Algorithm for Handling Time Sensitive and Scalable Transactions in Ubiquitous Computing Environments
摘要
In the realm of ubiquitous computing, the rapid proliferation of interconnected devices has created significant challenges for ensuring secure, reliable, and efficient transaction processing across distributed networks. The unique features of these systems marked by extensive device connectivity, a wide range of applications, and constrained computational resources demand the creation of sophisticated algorithms capable of handling transactions within stringent time limits. Ubiquitous computing environments demand highly efficient, fault tolerant, and scalable consensus protocols to ensure reliable coordination among distributed systems. This paper proposes a location based hierarchical raft consensus protocol, tailored for ubiquitous computing systems characterized by dynamic node distributions and mobility. The hierarchical raft consensus protocol improves upon traditional raft by using location aware clustering and a hierarchical leader election mechanism. These enhancements reduce communication overhead, boost fault tolerance, and speed up the consensus process. Simulation results demonstrate the protocol’s effectiveness in terms of latency, throughput, and scalability.