Difference between revisions of "Comparison"

From IridiaWiki
Jump to navigationJump to search
Line 8: Line 8:
 
|| Number of used opinions for voting strategy || Last 2 opinions in robot's memory || Last 2 opinions in robot's blockchain
 
|| Number of used opinions for voting strategy || Last 2 opinions in robot's memory || Last 2 opinions in robot's blockchain
 
|-
 
|-
|| Dissemination State || Time proportional to sensor readings ^p (sample from an exponential distribution with pg, g = 10, and ) || Use one of the strategies described below
+
|| Dissemination State || Time proportional to sensor readings p (sample from an exponential distribution with pg, g = 10) || Use one of the strategies described below
 
|-
 
|-
 
|| Exploration State|| Sample from an exponential distribution (sample from an exponential distribution with σ = 10)|| Disconnect from peers
 
|| Exploration State|| Sample from an exponential distribution (sample from an exponential distribution with σ = 10)|| Disconnect from peers

Revision as of 13:51, 30 January 2017

Problem

"How to transfer the sensors readings (quality of the opinion) into a secure dissemination strategy that is similar to the existing approach?"

Comparison

Feature Classical approach Blockchain approach
Number of used opinions for voting strategy Last 2 opinions in robot's memory Last 2 opinions in robot's blockchain
Dissemination State Time proportional to sensor readings p (sample from an exponential distribution with pg, g = 10) Use one of the strategies described below
Exploration State Sample from an exponential distribution (sample from an exponential distribution with σ = 10) Disconnect from peers

Strategies

Strategy 1: Amount of transactions

  • Send a transaction with 1 ether in each timestep of the dissemination state
  • Expected behavior:

Strategy 2: Direct modulation

  • Send one transaction each time a robot enters the dissemination state, include amount of ether that is proportional to the quality of the opinion
  • Expected behavior:

Strategy 3: Mining time

  • Make mining time proportional to the quality of the opinion
  • Expected behavior:

Strategy 4: Hash-puzzle

  • Robots have to solve a (hash-based) puzzle, whose difficulty is proportional to the quality of the opinion they want to send
  • Expected behavior:

Strategy 5: Most similar

  • Only connect to neighbors in the dissemination state
  • The longer a robot is in the state, the more other robots will receive its opinion
  • Problem: When do robots mine? Only in the last x seconds (fixed)? Or for a time proportional to their opinion?
  • Expected behavior:

Alternative

  • Use an alternative approach that is not similar to Gabri's approach
  • Expected behavior:
  • Advantages: Can tailor approach to the blockchain
  • Disadvantages: Might be harder to compare the approach and show its advantages