An independent broadcast on a graph $G$ is a function $f: V \longrightarrow \{0,\ldots,{\rm diam}(G)\}$ such that $(i)$ $f(v)\leq e(v)$ for every vertex $v\in V(G)$, where $\operatorname{diam}(G)$ denotes the diameter of $G$ and $e(v)$ the eccentricity of vertex $v$, and $(ii)$ $d(u,v) > \max \{f(u), f(v)\}$ for every two distinct vertices $u$ and $v$ with $f(u)f(v)>0$. The broadcast independence number $\beta_b(G)$ of $G$ is then the maximum value of $\sum_{v \in V} f(v)$, taken over all independent broadcasts on $G$. We prove that every circulant graph of the form $C(n;1,a)$, $3\le a\le \lfloor\frac{n}{2} \rfloor$, admits an optimal $2$-bounded independent broadcast, that is, an independent broadcast~$f$ satisfying $f(v)\le 2$ for every vertex $v$, except when $n=2a+1$, or $n=2a$ and $a$ is even. We then determine the broadcast independence number of various classes of such circulant graphs, and prove that, for most of these classes, the equality $\beta_b(C(n;1,a)) = \alpha(C(n;1,a))$ holds, where $\alpha(C(n;1,a))$ denotes the independence number of $C(n;1,a)$.

翻译：在图形中独立播放$G$是一个函数 $f : V\ longrightrow = 0,\ ldots,\\ lm diam}(G) $, 等於( i) $ f(v)\leq e(v) $, 每一个顶端$v( G) $( Operatorname{diam} (G) 美元表示美元和美元( 5) 的直径为$( 美元) 和美元( 美元) 顶端$( 美元) ; (二) $( 美元) > max( 美元) = max (f) (u) 美元; f(五) 美元= (五) 美元 美元, 每两个不同的顶端端端值 $( 美元) ; (一) 以每平面值為 $(c) 美元; (一) 以每平面的平面值為2美元; (a) 美元; (一) 以每平面為美元; (一美元; (一) 美元) 以每平面為美元; (一美元)