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

vault backup: 2024-11-06 22:02:37

Browse source
This commit is contained in:
Marco Realacci 2024-11-06 22:02:37 +01:00
parent c32fe3c233
commit bc43175468
2 changed files with 10 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

3
Autonomous Networking/notes/q&a.md
View file

@ -51,9 +51,6 @@ Every time a collision is generated, rags randomly increments their counter. The
As each time the tags are split into two sets, we can "see" it as a binary tree, so we can count the node of the tree to get an estimation.
$$BS_{tot}(n)=\begin{cases}1,n\le1\\ 1+\sum_{k=0}^{n}\binom{n}{k}\left(\frac12\right)^{k}\left(1-\frac12\right)^{n-k}\left(BS_{tot}\left(k\right)+BS_{tot}\left(n-k\right)\right),n>1\end{cases}$$
<<<<<<< HEAD
#### Q: explain the differences between proactive and reactive routing in sensor networks. Discuss the advantages and disadvantages
=======
#### Q: explain the differences between proactive and reactive routing in sensor networks. Discuss the advantages and disadvantages