Age of information games between power constrained schedulers and adversaries Article Swipe
Subhankar Banerjee
,
Şennur Ulukuş
,
Anthony Ephremides
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.23919/jcn.2023.000046
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.23919/jcn.2023.000046
We consider a time slotted communication network consisting of a base station (BS), an adversary, Ν users and N s communication channels. In the first part of the paper, we consider the setting where N s communication channels N s are heterogeneously divided among Ν users. The BS transmits an update to the ¿th user on a subset of the communication channels N s,i where N s,i ∩ N s,j is not necessarily an empty set. At each time slot, the BS transmits an update packet to a user through a communication channel and the adversary aims to block the update packet sent by the BS by blocking a communication channel. The BS has η discrete transmission power levels to communicate with the users and the adversary has m discrete blocking power levels to block the communication channels. The probability of successful transmission of an update packet depends on these power levels. The BS and the adversary have a transmission and blocking average power constraint, respectively. We provide a universal lower bound for the average age of information for this communication network. We prove that the uniform user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 4 optimal; and the max-age user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 2 optimal. In the second part of the paper, we consider the setting where the BS chooses a transmission policy and the adversary chooses a blocking policy from the set of randomized stationary policies and N s,i = N s for all i, i.e., all users can receive updates on all channels. We show that a Nash equilibrium may or may not exist for this communication network, and identify special cases where a Nash equilibrium always exists.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.23919/jcn.2023.000046
- https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdf
- OA Status
- diamond
- Cited By
- 4
- References
- 95
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4388836094
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4388836094Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.23919/jcn.2023.000046Digital Object Identifier
- Title
-
Age of information games between power constrained schedulers and adversariesWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-10-01Full publication date if available
- Authors
-
Subhankar Banerjee, Şennur Ulukuş, Anthony EphremidesList of authors in order
- Landing page
-
https://doi.org/10.23919/jcn.2023.000046Publisher landing page
- PDF URL
-
https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdfDirect OA link when available
- Concepts
-
Computer science, Network packet, Channel (broadcasting), Adversary, Computer network, Transmission (telecommunications), Computer security, TelecommunicationsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
4Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 2, 2024: 1, 2023: 1Per-year citation counts (last 5 years)
- References (count)
-
95Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4388836094 |
|---|---|
| doi | https://doi.org/10.23919/jcn.2023.000046 |
| ids.doi | https://doi.org/10.23919/jcn.2023.000046 |
| ids.openalex | https://openalex.org/W4388836094 |
| fwci | 1.75820917 |
| type | article |
| title | Age of information games between power constrained schedulers and adversaries |
| biblio.issue | 5 |
| biblio.volume | 25 |
| biblio.last_page | 642 |
| biblio.first_page | 631 |
| topics[0].id | https://openalex.org/T13553 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9994999766349792 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Age of Information Optimization |
| topics[1].id | https://openalex.org/T11896 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9757000207901001 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Opportunistic and Delay-Tolerant Networks |
| topics[2].id | https://openalex.org/T10772 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.935699999332428 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Distributed systems and fault tolerance |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.649480938911438 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C158379750 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5888773202896118 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q214111 |
| concepts[1].display_name | Network packet |
| concepts[2].id | https://openalex.org/C127162648 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5107012391090393 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q16858953 |
| concepts[2].display_name | Channel (broadcasting) |
| concepts[3].id | https://openalex.org/C41065033 |
| concepts[3].level | 2 |
| concepts[3].score | 0.48930713534355164 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q2825412 |
| concepts[3].display_name | Adversary |
| concepts[4].id | https://openalex.org/C31258907 |
| concepts[4].level | 1 |
| concepts[4].score | 0.44730469584465027 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[4].display_name | Computer network |
| concepts[5].id | https://openalex.org/C761482 |
| concepts[5].level | 2 |
| concepts[5].score | 0.42113539576530457 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q118093 |
| concepts[5].display_name | Transmission (telecommunications) |
| concepts[6].id | https://openalex.org/C38652104 |
| concepts[6].level | 1 |
| concepts[6].score | 0.19891005754470825 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q3510521 |
| concepts[6].display_name | Computer security |
| concepts[7].id | https://openalex.org/C76155785 |
| concepts[7].level | 1 |
| concepts[7].score | 0.18387064337730408 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[7].display_name | Telecommunications |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.649480938911438 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/network-packet |
| keywords[1].score | 0.5888773202896118 |
| keywords[1].display_name | Network packet |
| keywords[2].id | https://openalex.org/keywords/channel |
| keywords[2].score | 0.5107012391090393 |
| keywords[2].display_name | Channel (broadcasting) |
| keywords[3].id | https://openalex.org/keywords/adversary |
| keywords[3].score | 0.48930713534355164 |
| keywords[3].display_name | Adversary |
| keywords[4].id | https://openalex.org/keywords/computer-network |
| keywords[4].score | 0.44730469584465027 |
| keywords[4].display_name | Computer network |
| keywords[5].id | https://openalex.org/keywords/transmission |
| keywords[5].score | 0.42113539576530457 |
| keywords[5].display_name | Transmission (telecommunications) |
| keywords[6].id | https://openalex.org/keywords/computer-security |
| keywords[6].score | 0.19891005754470825 |
| keywords[6].display_name | Computer security |
| keywords[7].id | https://openalex.org/keywords/telecommunications |
| keywords[7].score | 0.18387064337730408 |
| keywords[7].display_name | Telecommunications |
| language | en |
| locations[0].id | doi:10.23919/jcn.2023.000046 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S173102057 |
| locations[0].source.issn | 1229-2370, 1976-5541 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1229-2370 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Journal of Communications and Networks |
| locations[0].source.host_organization | https://openalex.org/P4310319808 |
| locations[0].source.host_organization_name | Institute of Electrical and Electronics Engineers |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319808 |
| locations[0].source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| locations[0].license | |
| locations[0].pdf_url | https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Journal of Communications and Networks |
| locations[0].landing_page_url | https://doi.org/10.23919/jcn.2023.000046 |
| indexed_in | crossref |
| 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].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I66946132 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| authorships[0].institutions[0].id | https://openalex.org/I66946132 |
| authorships[0].institutions[0].ror | https://ror.org/047s2c258 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I66946132 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | University of Maryland, College Park |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Subhankar Banerjee |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| 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].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I66946132 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| authorships[1].institutions[0].id | https://openalex.org/I66946132 |
| authorships[1].institutions[0].ror | https://ror.org/047s2c258 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I66946132 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | University of Maryland, College Park |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Sennur Ulukus |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| authorships[2].author.id | https://openalex.org/A5008039780 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-0172-8944 |
| authorships[2].author.display_name | Anthony Ephremides |
| authorships[2].countries | US |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I66946132 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| authorships[2].institutions[0].id | https://openalex.org/I66946132 |
| authorships[2].institutions[0].ror | https://ror.org/047s2c258 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I66946132 |
| authorships[2].institutions[0].country_code | US |
| authorships[2].institutions[0].display_name | University of Maryland, College Park |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Anthony Ephremides |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, 20742 USA |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdf |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Age of information games between power constrained schedulers and adversaries |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T13553 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9994999766349792 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Age of Information Optimization |
| related_works | https://openalex.org/W4388150944, https://openalex.org/W4242235492, https://openalex.org/W2367268135, https://openalex.org/W1480190076, https://openalex.org/W4237162029, https://openalex.org/W2385701518, https://openalex.org/W4237464767, https://openalex.org/W1658340114, https://openalex.org/W2395750098, https://openalex.org/W2150112053 |
| cited_by_count | 4 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 2 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.23919/jcn.2023.000046 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S173102057 |
| best_oa_location.source.issn | 1229-2370, 1976-5541 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1229-2370 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Journal of Communications and Networks |
| best_oa_location.source.host_organization | https://openalex.org/P4310319808 |
| best_oa_location.source.host_organization_name | Institute of Electrical and Electronics Engineers |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319808 |
| best_oa_location.source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Journal of Communications and Networks |
| best_oa_location.landing_page_url | https://doi.org/10.23919/jcn.2023.000046 |
| primary_location.id | doi:10.23919/jcn.2023.000046 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S173102057 |
| primary_location.source.issn | 1229-2370, 1976-5541 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1229-2370 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Journal of Communications and Networks |
| primary_location.source.host_organization | https://openalex.org/P4310319808 |
| primary_location.source.host_organization_name | Institute of Electrical and Electronics Engineers |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319808 |
| primary_location.source.host_organization_lineage_names | Institute of Electrical and Electronics Engineers |
| primary_location.license | |
| primary_location.pdf_url | https://ieeexplore.ieee.org/ielx7/5449605/10323420/10323426.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Journal of Communications and Networks |
| primary_location.landing_page_url | https://doi.org/10.23919/jcn.2023.000046 |
| publication_date | 2023-10-01 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W2967610665, https://openalex.org/W6794419825, https://openalex.org/W2902198570, https://openalex.org/W2808948305, https://openalex.org/W6748134498, https://openalex.org/W2999201473, https://openalex.org/W4221139246, https://openalex.org/W4225603129, https://openalex.org/W6799028050, https://openalex.org/W3015927507, https://openalex.org/W2904795012, https://openalex.org/W3004050480, https://openalex.org/W2997037399, https://openalex.org/W3016567321, https://openalex.org/W3024494701, https://openalex.org/W6794243520, https://openalex.org/W2906008346, https://openalex.org/W3111221393, https://openalex.org/W2979722372, https://openalex.org/W3113772021, https://openalex.org/W2805208908, https://openalex.org/W2884466981, https://openalex.org/W2825335763, https://openalex.org/W2976114880, https://openalex.org/W3039067001, https://openalex.org/W2752845512, https://openalex.org/W2783194249, https://openalex.org/W2782340910, https://openalex.org/W3048471005, https://openalex.org/W3163357621, https://openalex.org/W4229451314, https://openalex.org/W4280587634, https://openalex.org/W6745067802, https://openalex.org/W2944580845, https://openalex.org/W2798532758, https://openalex.org/W6775576450, https://openalex.org/W6732816876, https://openalex.org/W2733656312, https://openalex.org/W3033376973, https://openalex.org/W6757566778, https://openalex.org/W2947287611, https://openalex.org/W6771864892, https://openalex.org/W2582952306, https://openalex.org/W2961865050, https://openalex.org/W2649848418, https://openalex.org/W6749166456, https://openalex.org/W2982655620, https://openalex.org/W2807603205, https://openalex.org/W6790883413, https://openalex.org/W6742830426, https://openalex.org/W6780544281, https://openalex.org/W7074682839, https://openalex.org/W2895249296, https://openalex.org/W2992046713, https://openalex.org/W3080482303, https://openalex.org/W3131549899, https://openalex.org/W2963630011, https://openalex.org/W4323520918, https://openalex.org/W3015574552, https://openalex.org/W3034502728, https://openalex.org/W3186504573, https://openalex.org/W3013374752, https://openalex.org/W3032653123, https://openalex.org/W2971937201, https://openalex.org/W2964226961, https://openalex.org/W2742721402, https://openalex.org/W3048950558, https://openalex.org/W2964154283, https://openalex.org/W4289655403, https://openalex.org/W2962879668, https://openalex.org/W565955800, https://openalex.org/W3125943371, https://openalex.org/W3104436821, https://openalex.org/W3197585983, https://openalex.org/W3126316352, https://openalex.org/W2963869148, https://openalex.org/W3020925646, https://openalex.org/W2964250104, https://openalex.org/W4205984110, https://openalex.org/W3110005680, https://openalex.org/W3197176973, https://openalex.org/W4207032926, https://openalex.org/W2963085502, https://openalex.org/W3181171726, https://openalex.org/W3137144115, https://openalex.org/W3138501765, https://openalex.org/W3153851140, https://openalex.org/W4211024811, https://openalex.org/W4310901994, https://openalex.org/W2963782453, https://openalex.org/W3105138911, https://openalex.org/W3214554272, https://openalex.org/W3137257456, https://openalex.org/W2963270598, https://openalex.org/W4283205552 |
| referenced_works_count | 95 |
| abstract_inverted_index.2 | 240 |
| abstract_inverted_index.4 | 217 |
| abstract_inverted_index.= | 279 |
| abstract_inverted_index.N | 18, 36, 42, 68, 73, 78, 275, 280 |
| abstract_inverted_index.a | 2, 9, 62, 99, 102, 120, 170, 180, 257, 264, 299, 316 |
| abstract_inverted_index.m | 140 |
| abstract_inverted_index.At | 88 |
| abstract_inverted_index.BS | 53, 93, 117, 124, 165, 255 |
| abstract_inverted_index.In | 24, 242 |
| abstract_inverted_index.We | 0, 178, 194, 296 |
| abstract_inverted_index.an | 13, 55, 85, 95, 156 |
| abstract_inverted_index.by | 115, 118 |
| abstract_inverted_index.i, | 286 |
| abstract_inverted_index.is | 82, 216, 239 |
| abstract_inverted_index.of | 8, 28, 64, 152, 155, 188, 246, 270 |
| abstract_inverted_index.on | 61, 160, 293 |
| abstract_inverted_index.or | 303 |
| abstract_inverted_index.to | 57, 98, 109, 131, 145 |
| abstract_inverted_index.we | 31, 249 |
| abstract_inverted_index.Ν | 15, 50 |
| abstract_inverted_index.η | 126 |
| abstract_inverted_index.The | 52, 123, 150, 164 |
| abstract_inverted_index.age | 187 |
| abstract_inverted_index.all | 285, 288, 294 |
| abstract_inverted_index.and | 17, 105, 136, 166, 172, 219, 260, 274, 311 |
| abstract_inverted_index.any | 209, 232 |
| abstract_inverted_index.are | 46 |
| abstract_inverted_index.can | 290 |
| abstract_inverted_index.for | 184, 190, 284, 307 |
| abstract_inverted_index.has | 125, 139 |
| abstract_inverted_index.may | 302, 304 |
| abstract_inverted_index.not | 83, 305 |
| abstract_inverted_index.set | 269 |
| abstract_inverted_index.the | 25, 29, 33, 58, 65, 92, 106, 111, 116, 134, 137, 147, 167, 185, 197, 202, 220, 225, 243, 247, 251, 254, 261, 268 |
| abstract_inverted_index.∩ | 77 |
| abstract_inverted_index.<inf | 19, 37, 43, 69, 74, 79, 276, 281 |
| abstract_inverted_index.Nash | 300, 317 |
| abstract_inverted_index.aims | 108 |
| abstract_inverted_index.base | 10 |
| abstract_inverted_index.each | 89 |
| abstract_inverted_index.from | 267 |
| abstract_inverted_index.have | 169 |
| abstract_inverted_index.part | 27, 245 |
| abstract_inverted_index.sent | 114 |
| abstract_inverted_index.set. | 87 |
| abstract_inverted_index.show | 297 |
| abstract_inverted_index.that | 196, 298 |
| abstract_inverted_index.this | 191, 308 |
| abstract_inverted_index.time | 3, 90 |
| abstract_inverted_index.user | 60, 100, 199, 222 |
| abstract_inverted_index.with | 133, 208, 231 |
| abstract_inverted_index.¿th | 59 |
| abstract_inverted_index.(BS), | 12 |
| abstract_inverted_index.among | 49 |
| abstract_inverted_index.block | 110, 146 |
| abstract_inverted_index.bound | 183 |
| abstract_inverted_index.cases | 314 |
| abstract_inverted_index.empty | 86 |
| abstract_inverted_index.exist | 306 |
| abstract_inverted_index.first | 26 |
| abstract_inverted_index.i.e., | 287 |
| abstract_inverted_index.lower | 182 |
| abstract_inverted_index.power | 129, 143, 162, 175, 213, 236 |
| abstract_inverted_index.prove | 195 |
| abstract_inverted_index.slot, | 91 |
| abstract_inverted_index.these | 161 |
| abstract_inverted_index.users | 16, 135, 289 |
| abstract_inverted_index.where | 35, 72, 253, 315 |
| abstract_inverted_index.always | 319 |
| abstract_inverted_index.levels | 130, 144 |
| abstract_inverted_index.packet | 97, 113, 158 |
| abstract_inverted_index.paper, | 30, 248 |
| abstract_inverted_index.policy | 207, 215, 230, 238, 259, 266 |
| abstract_inverted_index.second | 244 |
| abstract_inverted_index.subset | 63 |
| abstract_inverted_index.update | 56, 96, 112, 157 |
| abstract_inverted_index.users. | 51 |
| abstract_inverted_index.average | 174, 186 |
| abstract_inverted_index.channel | 104, 205, 228 |
| abstract_inverted_index.chooses | 256, 263 |
| abstract_inverted_index.depends | 159 |
| abstract_inverted_index.divided | 48 |
| abstract_inverted_index.exists. | 320 |
| abstract_inverted_index.levels. | 163 |
| abstract_inverted_index.max-age | 221 |
| abstract_inverted_index.network | 6 |
| abstract_inverted_index.policy, | 201, 224 |
| abstract_inverted_index.provide | 179 |
| abstract_inverted_index.receive | 291 |
| abstract_inverted_index.setting | 34, 252 |
| abstract_inverted_index.slotted | 4 |
| abstract_inverted_index.special | 313 |
| abstract_inverted_index.station | 11 |
| abstract_inverted_index.through | 101 |
| abstract_inverted_index.uniform | 198, 203, 226 |
| abstract_inverted_index.updates | 292 |
| abstract_inverted_index.blocking | 119, 142, 173, 265 |
| abstract_inverted_index.channel. | 122 |
| abstract_inverted_index.channels | 41, 67 |
| abstract_inverted_index.choosing | 200, 206, 214, 223, 229, 237 |
| abstract_inverted_index.consider | 1, 32, 250 |
| abstract_inverted_index.discrete | 127, 141 |
| abstract_inverted_index.feasible | 211, 234 |
| abstract_inverted_index.identify | 312 |
| abstract_inverted_index.network, | 310 |
| abstract_inverted_index.network. | 193 |
| abstract_inverted_index.optimal. | 241 |
| abstract_inverted_index.optimal; | 218 |
| abstract_inverted_index.policies | 273 |
| abstract_inverted_index.adversary | 107, 138, 168, 262 |
| abstract_inverted_index.arbitrary | 210, 233 |
| abstract_inverted_index.channels. | 23, 149, 295 |
| abstract_inverted_index.transmits | 54, 94 |
| abstract_inverted_index.universal | 181 |
| abstract_inverted_index.adversary, | 14 |
| abstract_inverted_index.consisting | 7 |
| abstract_inverted_index.randomized | 271 |
| abstract_inverted_index.stationary | 272 |
| abstract_inverted_index.successful | 153 |
| abstract_inverted_index.communicate | 132 |
| abstract_inverted_index.constraint, | 176 |
| abstract_inverted_index.equilibrium | 301, 318 |
| abstract_inverted_index.information | 189 |
| abstract_inverted_index.necessarily | 84 |
| abstract_inverted_index.probability | 151 |
| abstract_inverted_index.transmission | 128, 154, 171, 212, 235, 258 |
| abstract_inverted_index.communication | 5, 22, 40, 66, 103, 121, 148, 192, 204, 227, 309 |
| abstract_inverted_index.respectively. | 177 |
| abstract_inverted_index.heterogeneously | 47 |
| abstract_inverted_index.xmlns:mml="http://www.w3.org/1998/Math/MathML" | 20, 38, 44, 70, 75, 80, 277, 282 |
| abstract_inverted_index.xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> | 21, 39, 45, 283 |
| abstract_inverted_index.xmlns:xlink="http://www.w3.org/1999/xlink">s,i</inf> | 71, 76, 278 |
| abstract_inverted_index.xmlns:xlink="http://www.w3.org/1999/xlink">s,j</inf> | 81 |
| cited_by_percentile_year.max | 97 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.77267519 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |