1 / 4

Distributed Leader Election for Dynamic AKDs: Challenges and Solutions

This on-going effort explores the security and performance requirements for the election of leaders in dynamic AKDs (Area Key Distributors). The approach involves a distributed leader election via expanding ring search, ensuring verifiability and robustness in the presence of malicious nodes. Research issues include proof of non-fraudulent election, metrics for leader selection, and the quality of elected leaders. The study compares synchronous and asynchronous algorithms for multiple AKDs in partitioned areas.

lore
Télécharger la présentation

Distributed Leader Election for Dynamic AKDs: Challenges and Solutions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. On-going effort: dynamic AKDs Challenge: AKD’s mobile, vulnerable - area nodes may need to determine (“elect”) new AKD Requirements: • Security: AKD election in presence of malicious nodes • DKD only trusted authority • verifiability: fraudulently-elected leader eventually detected • Performance: • elected AKD that is “good” (e.g., topologically close to area members, has high power, has high trust level) Approach: distributed leader election via expanding ring search, using data signed by DKD

  2. Dynamic AKDs: distributed leader election Approach: distributed leader election via expanding ring search, using data signed by DKD • lack central location for centralized algorithm • messaage-efficient election via expanding ring search • robustness of election (as opposed to centralized optimization) wrt malicious/failed nodes • conjecture: elected leader close to optimal

  3. Dynamic AKDs: Research issues • proof/verifiability of non-fraudulent election • metrics for leader election (topology, level of trust) • “quality” of elected leader: how close to optimal is elected leader? • multiple AKDs elected in partitioned or partitionable areas? • synchronous versus asynchronous algorithms

  4. Conclusion • Blah blah blah blah

More Related