With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes ...With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.展开更多
To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in t...To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.展开更多
Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than th...Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.展开更多
基金Prospective Research Project on Future Networks of Jiangsu Province,China(No.BY2013095-1-18)
文摘With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree（ MST）-based quantum distribution algorithm（ QDMST） is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios.
基金Supported by the National Natural Science Foundation of China(No.61133016)the Sichuan Science and Technology Support Project(No.2013GZ0022)+1 种基金the Scientific Research Fund of Xinjiang Provincial Education Department(No.XJEDU2013128)the Technology Supporting Xinjiang Project(No.201491121)
文摘To alleviate the localization error introduced by irregular sensor network deployment, a new mo bile path localization based on key nodes （MPLPK） protocol is proposed. It can recognize all con cave/convex nodes in the network as fixed anchor nodes, and simplify the following localization process based on these key nodes. The MPLPK protocol is composed of three steps. After all key nodes are found in the network, a mobile node applying improved minimum spanning tree （MST） algorithm is introduced to traverse and locate them. By taking the concave/convex nodes as anchors, the complexity of the irregular network can be degraded. And the simulation results demonstrate that MPEPK has 20% to 40% accuracy improvements than connectivity-based and anchor-free three-di- mensional localization （CATL） and approximate convex decomposition based localization （ACDL）.
文摘Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.
