marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2024-11-06 22:00:13

Browse source
This commit is contained in:
Marco Realacci 2024-11-06 22:00:13 +01:00
parent 8ed6178a39
commit fdb098f09e
2 changed files with 22 additions and 33 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Autonomous Networking/notes/2 RFID.md
View file

@ -149,6 +149,10 @@ I look for the n (number of tags) value that minimizes the difference!
Given N and a possible value of n, the expected number of slots with r tags is estimated as:
![[Pasted image 20240928181424.png]]
$a_{0}=$ numero stimato di slot in cui non risponde nessun tag
$a_{1}=$ numero stimato di slot in cui risponde un solo tag (numero di identificazioni)
$a_{n}$ = numero stimato di slot in cui rispondono 2 o più tag
##### Inaccuracy of tag estimation for large networks
- The estimator does not capture the possibly high variance of the number of tags
- The minimum distance is computed over n ranging in $[c_1 + 2c_k, 2(c1 + 2c_k)]$