Age of $k$-out-of-$n$ Systems on a Gossip Network
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916396900810752 |
|---|---|
| author | Bayram, Erkan Bastopcu, Melih Belabbas, Mohamed-Ali Başar, Tamer |
| author_facet | Bayram, Erkan Bastopcu, Melih Belabbas, Mohamed-Ali Başar, Tamer |
| contents | We consider information update systems on a gossip network, which consists of a single source and $n$ receiver nodes. The source encrypts the information into $n$ distinct keys with version stamps, sending a unique key to each node. For decoding the information in a $k$-out-of-$n$ system, each receiver node requires at least $k+1$ different keys with the same version, shared over peer-to-peer connections. Each node determines $k$ based on a given function, ensuring that as $k$ increases, the precision of the decoded information also increases. We consider two different schemes: a memory scheme (in which the nodes keep the source's current and previous encrypted messages) and a memoryless scheme (in which the nodes are allowed to only keep the source's current message). We measure the ''timeliness'' of information updates by using the $k$-keys version age of information. Our work focuses on determining closed-form expressions for the time average age of information in a heterogeneous random graph under both with memory and memoryless schemes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11462 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Age of $k$-out-of-$n$ Systems on a Gossip Network Bayram, Erkan Bastopcu, Melih Belabbas, Mohamed-Ali Başar, Tamer Information Theory Networking and Internet Architecture Systems and Control We consider information update systems on a gossip network, which consists of a single source and $n$ receiver nodes. The source encrypts the information into $n$ distinct keys with version stamps, sending a unique key to each node. For decoding the information in a $k$-out-of-$n$ system, each receiver node requires at least $k+1$ different keys with the same version, shared over peer-to-peer connections. Each node determines $k$ based on a given function, ensuring that as $k$ increases, the precision of the decoded information also increases. We consider two different schemes: a memory scheme (in which the nodes keep the source's current and previous encrypted messages) and a memoryless scheme (in which the nodes are allowed to only keep the source's current message). We measure the ''timeliness'' of information updates by using the $k$-keys version age of information. Our work focuses on determining closed-form expressions for the time average age of information in a heterogeneous random graph under both with memory and memoryless schemes. |
| title | Age of $k$-out-of-$n$ Systems on a Gossip Network |
| topic | Information Theory Networking and Internet Architecture Systems and Control |
| url | https://arxiv.org/abs/2402.11462 |