Maximum Throughput of Clandestine Relay: Proof of Selected Theorems

In this technical report, we provide a detailed proof for some of the theorems on the clandestine throughput in [1]. In the paper, we define the clandestine throughput as the maximum (asymptotic) fraction of matched packets in a given pair of stochastic transmission schedules. If each transmission has a fixed duration (called fixed “packet length”), then the schedules can be modeled as point processes, and i.i.d. renewal processes are considered in the analysis. Under the strict delay constraint, we have proposed an optimal flow-embedding algorithm “Strict Greedy Match” (SGM) to compute the clandestine throughput.

By: Ting He

Published in: RC24634 in 2008


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .