Download
1 / 4
40 likes | 112 Views
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.
E N D
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
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
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
Conclusion • Blah blah blah blah
