Date of Award
2025
Document Type
Thesis
Degree Name
Master of Science (MS)
Department
Mathematical Sciences
Committee Chair
Daniel Bossaller
Committee Member
Guo-Hui Zhang
Committee Member
Satyaki Roy
Research Advisor
Daniel Bossaller
Subject(s)
Computer networks, Graph theory, Information theory, Coding theory
Abstract
This thesis investigates the capacity of time-varying adversarial networks where intelligent adversaries can corrupt transmissions on restricted subsets of network edges that change availability over time. Building upon the work of Beemer et al. on adversarial network coding with restricted adversaries, we analyze networks whose topology evolves temporally, motivated by applications in space networking and delay-tolerant systems. We introduce different adversarial modes that capture different temporal aspects of corruption behavior and establish their hierarchical relationship with respect to network capacity. The analysis employs time-expanded graph representations and develops recursive counting methods for computing expected network capacity under random time assignments, along with degradation matrix decompositions to enumerate network failure scenarios. We extend classical capacity bounds to time-varying settings where a network yields an expected capacity under uniform random edge- time assignment. The framework provides tools for analyzing communication systems where connectivity patterns evolve over time while operating under adversarial interference.
Recommended Citation
Thorp, Raphael, "Information capacity for time-varying adversarial networks" (2025). Theses. 784.
https://louis.uah.edu/uah-theses/784