Age of information in gossip networks with selective node subscription and threshold reconstruction

Bayram, Erkan

Permalink

https://hdl.handle.net/2142/129944 Copy

Description

Title

Age of information in gossip networks with selective node subscription and threshold reconstruction

Author(s)

Bayram, Erkan

Issue Date

2025-07-25

Director of Research (if dissertation) or Advisor (if thesis)

Belabbas, Mohamed-Ali

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

Age of information, version age of information, gossip network, coded updates, multitude dissemination

Abstract

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.

Graduation Semester

2025-08

Type of Resource

Thesis

Handle URL

https://hdl.handle.net/2142/129944

Copyright and License Information

Copyright 2025 Erkan Bayram

Owning Collections