Difference between revisions of "Comparison"
From IridiaWiki
Jump to navigationJump to search| Line 4: | Line 4: | ||
|| Num Blocks || 2 || 2 |
|| Num Blocks || 2 || 2 |
||
|- |
|- |
||
| − | || Dissemination || Time proportional to sensor readings (sample from an exponential distribution) || |
+ | || Dissemination || Time proportional to sensor readings (sample from an exponential distribution) || Use one of the strategies described below |
|} |
|} |
||
| + | |||
| + | Problem: "How to transfer the sensors readings (quality of the opinion) into a secure dissemination strategy that is similar to the existing approach?" |
||
| + | |||
| + | |||
| + | === 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 |
||
Revision as of 12:31, 30 January 2017
| Feature | Classical approach | Blockchain approach |
|---|---|---|
| Num Blocks | 2 | 2 |
| Dissemination | Time proportional to sensor readings (sample from an exponential distribution) | Use one of the strategies described below |
Problem: "How to transfer the sensors readings (quality of the opinion) into a secure dissemination strategy that is similar to the existing approach?"
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
