Overlay networks are used widely in the Internet, such as retrieval and share of files, multimedia games and so on. However, in distributed system, the retrieval and share of 2-dimension spatial data still have some d...
详细信息
Overlay networks are used widely in the Internet, such as retrieval and share of files, multimedia games and so on. However, in distributed system, the retrieval and share of 2-dimension spatial data still have some difficult problems and can not solve the complex retrieval of 2-dimension spatial data efficiently. This article presents a new indexing overlay networks, named 2D-Ring, which is the ring topology based on gossip for 2-dimension spatial data. The peers in our overlay networks exchange the information periodically and update each local view by constructing algorithm. 2-dimension spatial data is divided by quad-tree and mapped into control points, which are hashed into 2D-Ring by SHA-1 hash function. In such way, the problem of 2-dimension spatial data indexing is converted to the problem of searching peers in the 2D-Ring. A large of extensive experiments show that the time complexity of constructing algorithm of 2D-Ring can reach convergence logarithmically as a function of the network size and hold higher hit rate and lower query delay.
We present two two-step practical entanglement concentration protocols for concentrating an arbitrary three-particle less-entangled W state into a maximally entangled W state assisted with single photons. The first pr...
详细信息
We present two two-step practical entanglement concentration protocols for concentrating an arbitrary three-particle less-entangled W state into a maximally entangled W state assisted with single photons. The first protocol uses the linear optics and the second protocol adopts the cross–Kerr nonlinearity to perform the protocol. In the first protocol, based on the postselection principle, three parties say Alice, Bob, and Charlie in different distant locations can obtain the maximally entangled W state from the arbitrary less-entangled W state with a certain success probability. In the second protocol, the parties are not required to possess the sophisticated single-photon detectors and the concentrated photon pair can be retained after performing this protocol successfully. Moreover, the second protocol can be repeated to get a higher success probability. Both protocols may be useful in practical quantum-information applications.
We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary sin...
详细信息
We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary single photon with a certain probability, while the conventional ECPs require two copies of partially entangled pairs at least. Our first protocol is implemented with linear optics and the second protocol is implemented with cross-Kerr-nonlinearities. Compared with other ECPs, they do not need to know the accurate coefficients of the initial state. With linear optics, it is feasible with current experiments. With cross-Kerr-nonlinearities, it does not require sophisticated single-photon detectors and can be repeated to get a higher success probability. Moreover, the second protocol can get the higher entanglement transformation efficiency and it may be the most economical protocol by far. Meanwhile, both protocols are more suitable for multiphoton system concentration because they need less operations and classical communications. All these advantages make the two protocols useful in current long-distance quantum communications.
In this paper, we consider a power-aware multimedia communications over internet of things (IoT). Specifically, we consider a generic IoT scenario where a multimedia server provides heterogeneous applications without ...
详细信息
ISBN:
(纸本)9781457720529
In this paper, we consider a power-aware multimedia communications over internet of things (IoT). Specifically, we consider a generic IoT scenario where a multimedia server provides heterogeneous applications without knowing the application's quality of experience (QoE) model and playout period. Our objective aims at dynamically adjusting the power allocation for each application over a uncertain period to maximize the system overall mean opinion score (MOS). Note that the practical QoE model can be observed over time, but the underlying functional relationship between the power and MOS is unknown. The highlight of this paper is to develop a dynamic powering algorithm, in which one learns the satisfaction function and optimizes power-aware user satisfaction with on-line operation. More precisely, the proposed algorithm performance is measured in terms of loss which denotes the MOS loss compared to the optimal one. Numerical simulation results validate the efficiency of the proposed algorithm.
Cognitive radio(CR) is a concept to improve the utilization of scarce spectrum resources in wireless communication, and orthogonal frequency division multiplexing (OFDM) is regarded as the best technology to match wit...
详细信息
Standard TCP perform poorly in satellite networks since the long delay, high bit error ratio and other characters. A new TCP variant, called BIPR for satellite networks is presented in this paper. Using the binary inc...
详细信息
This paper studies the selective forwarding attacks in wireless sensornetworks (WSNs) and proposes a method to detect selective forwarding attacks based on digital watermarking technology. This method embeds watermar...
详细信息
In this paper, an improved game-theoretic spectrum sharing algorithm is proposed. Besides considering the available bandwidth, a reliance factor that represents how the primary users would like to lease the free spect...
详细信息
This paper addresses the information rate maximization problem under interference temperature constraint for a multiple-in multiple-out cognitive radio (MIMO-CR) network in which each CR user is equipped with multiple...
详细信息
In order to solve the controllability problem of worm attack range and effect in network counterwork and achieve the precise attack on the target host, we propose a propagation control method based on lifetime and a d...
详细信息
暂无评论