Optimizing Key Distribution in Peer to Peer Network Using B-Trees
Abdulrahman Aldhaheri, Hammoud Alshammari, Majid Alshammari

TL;DR
This paper proposes a novel key distribution scheme for peer-to-peer networks utilizing B-Trees to enhance efficiency and manageability in a decentralized environment.
Contribution
It introduces a new key distribution method based on B-Trees tailored for peer-to-peer networks, addressing existing management challenges.
Findings
Improved key distribution efficiency demonstrated in simulations
Enhanced scalability of peer-to-peer networks with the new scheme
Reduced key management overhead in decentralized settings
Abstract
Peer to peer network architecture introduces many desired features including self-scalability that led to achieving higher efficiency rate than the traditional server-client architecture. This was contributed to the highly distributed architecture of peer to peer network. Meanwhile, the lack of a centralized control unit in peer to peer network introduces some challenge. One of these challenges is key distribution and management in such an architecture. This research will explore the possibility of developing a novel scheme for distributing and managing keys in peer to peer network architecture efficiently.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Energy Efficient Wireless Sensor Networks · Network Security and Intrusion Detection
