{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/129944"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/129944","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Age of information in gossip networks with selective node subscription and threshold reconstruction","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms","abstract_has_math":false,"creators":["Bayram, Erkan"],"institution":"University of Illinois Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Belabbas, Mohamed-Ali"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-07-25","date_published":"2025-07-25","updated_at":"2026-07-22T22:25:06Z","subjects":["Age Of Information","Version Age Of Information","Gossip Network","Coded Updates","Multitude Dissemination"],"languages":["en","eng"],"rights":["Copyright 2025 Erkan Bayram"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/129944","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Belabbas, Mohamed-Ali"]},{"key":"dc:creator","label":"Author","values":["Bayram, Erkan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-07-25","2025-08"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Age Of Information","Version Age Of Information","Gossip Network","Coded Updates","Multitude Dissemination"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2025 Erkan Bayram"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/129944"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms","The student, Erkan Bayram, accepted the attached license on 2025-07-24 at 12:38.","The student, Erkan Bayram, submitted this Thesis for approval on 2025-07-24 at 12:41.","This Thesis was approved for publication on 2025-07-25 at 09:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22567 on 2025-10-20 at 20:15:18","Gossip protocols are utilized to reduce the connectivity requirements of communication networks while enabling efficient information dissemination to all nodes. However, they introduce the challenge of increased communication overhead, despite fewer direct connections. As a result, the timeliness of information at a receiving node, relative to the source, emerges as a critical performance metric. To capture this, a recent metric called Version Age of Information has been developed to quantify the gap between the current information state at receiving nodes and that at the source. In this thesis, we consider an information update system on a gossip network, where a source node encodes information into $n$ total keys such that any subset of at least $k+1$ keys can fully reconstruct the original information. This encoding process follows the principles of a $k$-out-of-$n$ threshold system. The encoded updates are then disseminated across the network through peer-to-peer communication. We have two different types of nodes in a network: subscriber nodes, which receive a unique key from the source node for every status update instantaneously, and nonsubscriber nodes, which receive a unique key for an update only if the node is selected by the source, and this selection is renewed for each update. For the message structure between nodes, 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 present explicit formulas for the time average AoI in a scalable homogeneous network as functions of the number of subscriber nodes under a memoryless scheme. Additionally, we provide strict lower and upper bounds for the time average AoI under a memory scheme."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Age of information in gossip networks with selective node subscription and threshold reconstruction"]}]}],"canonical_facts":{"dc:contributor":["Belabbas, Mohamed-Ali"],"dc:creator":["Bayram, Erkan"],"dc:date":["2025-07-25","2025-08"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms","The student, Erkan Bayram, accepted the attached license on 2025-07-24 at 12:38.","The student, Erkan Bayram, submitted this Thesis for approval on 2025-07-24 at 12:41.","This Thesis was approved for publication on 2025-07-25 at 09:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22567 on 2025-10-20 at 20:15:18","Gossip protocols are utilized to reduce the connectivity requirements of communication networks while enabling efficient information dissemination to all nodes. However, they introduce the challenge of increased communication overhead, despite fewer direct connections. As a result, the timeliness of information at a receiving node, relative to the source, emerges as a critical performance metric. To capture this, a recent metric called Version Age of Information has been developed to quantify the gap between the current information state at receiving nodes and that at the source. In this thesis, we consider an information update system on a gossip network, where a source node encodes information into $n$ total keys such that any subset of at least $k+1$ keys can fully reconstruct the original information. This encoding process follows the principles of a $k$-out-of-$n$ threshold system. The encoded updates are then disseminated across the network through peer-to-peer communication. We have two different types of nodes in a network: subscriber nodes, which receive a unique key from the source node for every status update instantaneously, and nonsubscriber nodes, which receive a unique key for an update only if the node is selected by the source, and this selection is renewed for each update. For the message structure between nodes, 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 present explicit formulas for the time average AoI in a scalable homogeneous network as functions of the number of subscriber nodes under a memoryless scheme. Additionally, we provide strict lower and upper bounds for the time average AoI under a memory scheme."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/129944"],"dc:language":["en","eng"],"dc:rights":["Copyright 2025 Erkan Bayram"],"dc:subject":["Age Of Information","Version Age Of Information","Gossip Network","Coded Updates","Multitude Dissemination"],"dc:title":["Age of information in gossip networks with selective node subscription and threshold reconstruction"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:06Z"}