The Freshness Game: Timely Communications in the Presence of an Adversary Article Swipe
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2302.14024
We consider a communication system where a base station (BS) transmits update packets to $N$ users, one user at a time, over a wireless channel. We investigate the age of this status updating system with an adversary that jams the update packets in the downlink. We consider two system models: with diversity and without diversity. In the model without diversity, we show that if the BS schedules the users with a stationary randomized policy, then the optimal choice for the adversary is to block the user which has the lowest probability of getting scheduled by the BS, at the middle of the time horizon, consecutively for $αT$ time slots. In the model with diversity, we show that for large $T$, the uniform user scheduling algorithm together with the uniform sub-carrier choosing algorithm is $\frac{2 N_{sub}}{N_{sub}-1}$ optimal. Next, we investigate the game theoretic equilibrium points of this status updating system. For the model without diversity, we show that a Nash equilibrium does not exist, however, a Stackelberg equilibrium exists when the scheduling algorithm of the BS acts as the leader and the adversary acts as the follower. For the model with diversity, we show that a Nash equilibrium exists and identify the Nash equilibrium. Finally, we extend the model without diversity to the case where the BS can serve multiple users and the adversary can jam multiple users, at a time.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2302.14024
- https://arxiv.org/pdf/2302.14024
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4322718241
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4322718241Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2302.14024Digital Object Identifier
- Title
-
The Freshness Game: Timely Communications in the Presence of an AdversaryWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-02-27Full publication date if available
- Authors
-
Subhankar Banerjee, Şennur UlukuşList of authors in order
- Landing page
-
https://arxiv.org/abs/2302.14024Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2302.14024Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2302.14024Direct OA link when available
- Concepts
-
Adversary, Computer security, Computer science, Business, AdvertisingTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4322718241 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2302.14024 |
| ids.doi | https://doi.org/10.48550/arxiv.2302.14024 |
| ids.openalex | https://openalex.org/W4322718241 |
| fwci | |
| type | preprint |
| title | The Freshness Game: Timely Communications in the Presence of an Adversary |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10133 |
| topics[0].field.id | https://openalex.org/fields/33 |
| topics[0].field.display_name | Social Sciences |
| topics[0].score | 0.34139999747276306 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/3315 |
| topics[0].subfield.display_name | Communication |
| topics[0].display_name | Media Studies and Communication |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41065033 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8243439197540283 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q2825412 |
| concepts[0].display_name | Adversary |
| concepts[1].id | https://openalex.org/C38652104 |
| concepts[1].level | 1 |
| concepts[1].score | 0.4935401678085327 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q3510521 |
| concepts[1].display_name | Computer security |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.45185911655426025 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C144133560 |
| concepts[3].level | 0 |
| concepts[3].score | 0.3311077058315277 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q4830453 |
| concepts[3].display_name | Business |
| concepts[4].id | https://openalex.org/C112698675 |
| concepts[4].level | 1 |
| concepts[4].score | 0.3202090263366699 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q37038 |
| concepts[4].display_name | Advertising |
| keywords[0].id | https://openalex.org/keywords/adversary |
| keywords[0].score | 0.8243439197540283 |
| keywords[0].display_name | Adversary |
| keywords[1].id | https://openalex.org/keywords/computer-security |
| keywords[1].score | 0.4935401678085327 |
| keywords[1].display_name | Computer security |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.45185911655426025 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/business |
| keywords[3].score | 0.3311077058315277 |
| keywords[3].display_name | Business |
| keywords[4].id | https://openalex.org/keywords/advertising |
| keywords[4].score | 0.3202090263366699 |
| keywords[4].display_name | Advertising |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2302.14024 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2302.14024 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2302.14024 |
| locations[1].id | doi:10.48550/arxiv.2302.14024 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2302.14024 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5005656212 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-8355-9162 |
| authorships[0].author.display_name | Subhankar Banerjee |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Banerjee, Subhankar |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5021132487 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-8219-8190 |
| authorships[1].author.display_name | Şennur Ulukuş |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Ulukus, Sennur |
| authorships[1].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2302.14024 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2023-03-03T00:00:00 |
| display_name | The Freshness Game: Timely Communications in the Presence of an Adversary |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10133 |
| primary_topic.field.id | https://openalex.org/fields/33 |
| primary_topic.field.display_name | Social Sciences |
| primary_topic.score | 0.34139999747276306 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/3315 |
| primary_topic.subfield.display_name | Communication |
| primary_topic.display_name | Media Studies and Communication |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2748952813, https://openalex.org/W4388150944, https://openalex.org/W4242235492, https://openalex.org/W2390279801, https://openalex.org/W4387985143, https://openalex.org/W4362599004, https://openalex.org/W2808242528, https://openalex.org/W1567638270, https://openalex.org/W3110049015 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2302.14024 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2302.14024 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2302.14024 |
| primary_location.id | pmh:oai:arXiv.org:2302.14024 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2302.14024 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2302.14024 |
| publication_date | 2023-02-27 |
| publication_year | 2023 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 2, 6, 19, 22, 70, 157, 164, 194, 228 |
| abstract_inverted_index.BS | 65, 174, 215 |
| abstract_inverted_index.In | 55, 109 |
| abstract_inverted_index.We | 0, 25, 45 |
| abstract_inverted_index.an | 35 |
| abstract_inverted_index.as | 176, 183 |
| abstract_inverted_index.at | 18, 97, 227 |
| abstract_inverted_index.by | 94 |
| abstract_inverted_index.if | 63 |
| abstract_inverted_index.in | 42 |
| abstract_inverted_index.is | 81, 132 |
| abstract_inverted_index.of | 29, 91, 100, 144, 172 |
| abstract_inverted_index.to | 13, 82, 210 |
| abstract_inverted_index.we | 60, 114, 137, 154, 191, 204 |
| abstract_inverted_index.$N$ | 14 |
| abstract_inverted_index.BS, | 96 |
| abstract_inverted_index.For | 149, 186 |
| abstract_inverted_index.age | 28 |
| abstract_inverted_index.and | 52, 179, 198, 220 |
| abstract_inverted_index.can | 216, 223 |
| abstract_inverted_index.for | 78, 105, 117 |
| abstract_inverted_index.has | 87 |
| abstract_inverted_index.jam | 224 |
| abstract_inverted_index.not | 161 |
| abstract_inverted_index.one | 16 |
| abstract_inverted_index.the | 27, 39, 43, 56, 64, 67, 75, 79, 84, 88, 95, 98, 101, 110, 120, 127, 139, 150, 169, 173, 177, 180, 184, 187, 200, 206, 211, 214, 221 |
| abstract_inverted_index.two | 47 |
| abstract_inverted_index.$T$, | 119 |
| abstract_inverted_index.(BS) | 9 |
| abstract_inverted_index.Nash | 158, 195, 201 |
| abstract_inverted_index.acts | 175, 182 |
| abstract_inverted_index.base | 7 |
| abstract_inverted_index.case | 212 |
| abstract_inverted_index.does | 160 |
| abstract_inverted_index.game | 140 |
| abstract_inverted_index.jams | 38 |
| abstract_inverted_index.over | 21 |
| abstract_inverted_index.show | 61, 115, 155, 192 |
| abstract_inverted_index.that | 37, 62, 116, 156, 193 |
| abstract_inverted_index.then | 74 |
| abstract_inverted_index.this | 30, 145 |
| abstract_inverted_index.time | 102, 107 |
| abstract_inverted_index.user | 17, 85, 122 |
| abstract_inverted_index.when | 168 |
| abstract_inverted_index.with | 34, 50, 69, 112, 126, 189 |
| abstract_inverted_index.$αT$ | 106 |
| abstract_inverted_index.Next, | 136 |
| abstract_inverted_index.block | 83 |
| abstract_inverted_index.large | 118 |
| abstract_inverted_index.model | 57, 111, 151, 188, 207 |
| abstract_inverted_index.serve | 217 |
| abstract_inverted_index.time, | 20 |
| abstract_inverted_index.time. | 229 |
| abstract_inverted_index.users | 68, 219 |
| abstract_inverted_index.where | 5, 213 |
| abstract_inverted_index.which | 86 |
| abstract_inverted_index.choice | 77 |
| abstract_inverted_index.exist, | 162 |
| abstract_inverted_index.exists | 167, 197 |
| abstract_inverted_index.extend | 205 |
| abstract_inverted_index.leader | 178 |
| abstract_inverted_index.lowest | 89 |
| abstract_inverted_index.middle | 99 |
| abstract_inverted_index.points | 143 |
| abstract_inverted_index.slots. | 108 |
| abstract_inverted_index.status | 31, 146 |
| abstract_inverted_index.system | 4, 33, 48 |
| abstract_inverted_index.update | 11, 40 |
| abstract_inverted_index.users, | 15, 226 |
| abstract_inverted_index.getting | 92 |
| abstract_inverted_index.models: | 49 |
| abstract_inverted_index.optimal | 76 |
| abstract_inverted_index.packets | 12, 41 |
| abstract_inverted_index.policy, | 73 |
| abstract_inverted_index.station | 8 |
| abstract_inverted_index.system. | 148 |
| abstract_inverted_index.uniform | 121, 128 |
| abstract_inverted_index.without | 53, 58, 152, 208 |
| abstract_inverted_index.$\frac{2 | 133 |
| abstract_inverted_index.Finally, | 203 |
| abstract_inverted_index.channel. | 24 |
| abstract_inverted_index.choosing | 130 |
| abstract_inverted_index.consider | 1, 46 |
| abstract_inverted_index.horizon, | 103 |
| abstract_inverted_index.however, | 163 |
| abstract_inverted_index.identify | 199 |
| abstract_inverted_index.multiple | 218, 225 |
| abstract_inverted_index.optimal. | 135 |
| abstract_inverted_index.together | 125 |
| abstract_inverted_index.updating | 32, 147 |
| abstract_inverted_index.wireless | 23 |
| abstract_inverted_index.adversary | 36, 80, 181, 222 |
| abstract_inverted_index.algorithm | 124, 131, 171 |
| abstract_inverted_index.diversity | 51, 209 |
| abstract_inverted_index.downlink. | 44 |
| abstract_inverted_index.follower. | 185 |
| abstract_inverted_index.scheduled | 93 |
| abstract_inverted_index.schedules | 66 |
| abstract_inverted_index.theoretic | 141 |
| abstract_inverted_index.transmits | 10 |
| abstract_inverted_index.diversity, | 59, 113, 153, 190 |
| abstract_inverted_index.diversity. | 54 |
| abstract_inverted_index.randomized | 72 |
| abstract_inverted_index.scheduling | 123, 170 |
| abstract_inverted_index.stationary | 71 |
| abstract_inverted_index.Stackelberg | 165 |
| abstract_inverted_index.equilibrium | 142, 159, 166, 196 |
| abstract_inverted_index.investigate | 26, 138 |
| abstract_inverted_index.probability | 90 |
| abstract_inverted_index.sub-carrier | 129 |
| abstract_inverted_index.equilibrium. | 202 |
| abstract_inverted_index.communication | 3 |
| abstract_inverted_index.consecutively | 104 |
| abstract_inverted_index.N_{sub}}{N_{sub}-1}$ | 134 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/17 |
| sustainable_development_goals[0].score | 0.46000000834465027 |
| sustainable_development_goals[0].display_name | Partnerships for the goals |
| citation_normalized_percentile |