A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast dominat...A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength t that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least r from its set of broadcasting neighbors. In this paper, we extend the study of (t, r) broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed (t, r) broadcast domination numbers of all orientations of a graph G. In particular, we prove that in the cases r = 1 and (t, r) = (2, 2), for every integer value in this interval, there exists an orientation of G which has directed (t, r) broadcast domination number equal to that value. We also investigate directed (t, r) broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.展开更多
现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升...现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升无线定向网络广播效率,提出一种基于最大完全子图与最小树形图的无线定向网络广播算法(maximum complete subgraph and minimum arborescence based directional broadcasting algorithm,MCSMA)。算法首先利用最大完全子图理论计算源节点或中继节点波束指向,使单个波束指向覆盖的邻居节点数量最多,然后利用最小树形图理论选择中继节点,使中继节点使用少量波束覆盖全网所有节点,降低广播过程中的消息转发次数。仿真表明,所提算法可有效减少广播过程中源节点和中继节点的波束指向次数,提升定向广播效率。展开更多
Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just take account of a simple broadcast communication t...Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and Greenberger- Horne-Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver, each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.展开更多
Two simple quantum broadcast communication schemes are proposed. A central party can broadcast his secret message to all the legitimate receivers simultaneously. Compared with the three schemes proposed recently （Wan...Two simple quantum broadcast communication schemes are proposed. A central party can broadcast his secret message to all the legitimate receivers simultaneously. Compared with the three schemes proposed recently （Wang et al. 2007 Chin. Phys. 16 1868）, the proposed schemes have the advantages of consuming fewer quantum and classical resources, lessening the difficulty and intensity of necessary operations, and having higher efficiency.展开更多
A quantum broadcast communication and authentication protocol with a quantum one-time pad based on the Greenberger-Horne-Zeilinger state is proposed. A binary string is used to express the identity of the receiver, wh...A quantum broadcast communication and authentication protocol with a quantum one-time pad based on the Greenberger-Horne-Zeilinger state is proposed. A binary string is used to express the identity of the receiver, which is encoded as a single sequence of photons. The encoded photon sequence acts as a detection sequence and implements au- thentication. An XOR operation serves as a one-time pad and is used to ensure the security of the protocol. The binary string is reused even in a noisy channel and proves to be unconditionally secure. In contrast with the protocols proposed by Wang et al. [Chin. Phys. 16 1868 （2007）] and Yang et al. [Chin. Phys. B 19 070304 （2010）], the protocol in this study implements the identity authentication with a reusable binary string; no hash function or local unitary operation is used. The protocol in this study is also easier to implement and highly efficient without losing security.展开更多
文摘A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength t that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least r from its set of broadcasting neighbors. In this paper, we extend the study of (t, r) broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed (t, r) broadcast domination numbers of all orientations of a graph G. In particular, we prove that in the cases r = 1 and (t, r) = (2, 2), for every integer value in this interval, there exists an orientation of G which has directed (t, r) broadcast domination number equal to that value. We also investigate directed (t, r) broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.
文摘现有关于无线定向网络广播的研究主要集中于如何选择中继节点或计算转发概率以提升分组递交率,减少广播冗余,但未对中继节点选择及波束指向计算开展联合设计,导致源节点及中继节点在广播过程中存在冗余指向,增加了消息转发次数。为提升无线定向网络广播效率,提出一种基于最大完全子图与最小树形图的无线定向网络广播算法(maximum complete subgraph and minimum arborescence based directional broadcasting algorithm,MCSMA)。算法首先利用最大完全子图理论计算源节点或中继节点波束指向,使单个波束指向覆盖的邻居节点数量最多,然后利用最小树形图理论选择中继节点,使中继节点使用少量波束覆盖全网所有节点,降低广播过程中的消息转发次数。仿真表明,所提算法可有效减少广播过程中源节点和中继节点的波束指向次数,提升定向广播效率。
基金Project supported by the National Natural Science Foundation of China （Grant No 60472032）.
文摘Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and Greenberger- Horne-Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver, each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.
基金supported by the National Basic Research Program of China (Grant No. 2007CB311100)the National Natural Science Foundation of China (Grant Nos. 60873191 and 60821001)+4 种基金the National High-Tech Research,Development Plan of China(Grant Nos. 2006AA01Z440,2009AA012441 and 2009AA012437)the Scientific Research Common Program of Beijing Municipal Commission of Education,China (Grant No. KM200810005004)Beijing Natural Science Foundation (Grant Nos. 1093015 and1102004)the State Key Laboratory of Integrated Services Network (ISN) open Foundation,China (Grant No. ISN-9-10)the Specialized Research Fund for the Doctoral Program of Higher Education,China (Grant No. 20091103120014)
文摘Two simple quantum broadcast communication schemes are proposed. A central party can broadcast his secret message to all the legitimate receivers simultaneously. Compared with the three schemes proposed recently （Wang et al. 2007 Chin. Phys. 16 1868）, the proposed schemes have the advantages of consuming fewer quantum and classical resources, lessening the difficulty and intensity of necessary operations, and having higher efficiency.
基金Project supported by the National Natural Science Foundation of China(Grant No.61370203)the Science and Technology Support Project of Sichuan Province,China(Grant No.13ZC2138)the Fund for Young Persons Project of Sichuan Province,China(Grant No.12ZB017)
文摘A quantum broadcast communication and authentication protocol with a quantum one-time pad based on the Greenberger-Horne-Zeilinger state is proposed. A binary string is used to express the identity of the receiver, which is encoded as a single sequence of photons. The encoded photon sequence acts as a detection sequence and implements au- thentication. An XOR operation serves as a one-time pad and is used to ensure the security of the protocol. The binary string is reused even in a noisy channel and proves to be unconditionally secure. In contrast with the protocols proposed by Wang et al. [Chin. Phys. 16 1868 （2007）] and Yang et al. [Chin. Phys. B 19 070304 （2010）], the protocol in this study implements the identity authentication with a reusable binary string; no hash function or local unitary operation is used. The protocol in this study is also easier to implement and highly efficient without losing security.
