Chen Zhi-gang

Treenet:A Web Services Composition Model Based on Spanning tree

Recently, Web service composition based on the Service Overlay Network has drawn much research attention. In this paper, we present a composition model capable of composing Web services across wide area networks with the service composition based on interface idea integrated with Peer to Peer technologies. It forms a novel Web Services Composition Overlay Network (WSCON) with Peer to Peer technologies, then associate nodes in the same Web services composition domain to form the Web Services Composition Network, according to domain ontology and its reasoning ability. Web service discovery and composition entry are performed through Distributed Hash Table (DHT). We have conducted extensive experiments using large-scale simulations. The experiment results show the advantages of our model: supporting Web service composition based on QoS, high composition success rate, fast service distribution, discovery and composition, and tolerant to dynamic service component node arrivals and departures.

An improved MPTCP in coded wireless mesh networks

It is a challenge that using multipath transmit packets based on network coding in wireless mesh networks (WMNs). This paper proposes a mechanism that naturally adds network coding to multipath routing network systems. In the mechanism, network coding is compatible with improved multipath TCP (MPTCP). The destination feedback the degree of freedom of encoding block, and delays of packet delivery minimize reordering and timeouts. Using MPTCP, the source can send more encode packets and the transmission rate becomes more faster, and the multiple paths can achieve stability, and the network achieves higher throughput.

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

A (n, n)-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.

Multiparty Quantum Secret Sharing of Quantum States with Quantum Registers

A quantum secret sharing scheme is proposed by making use of quantum registers. In the proposed scheme, secret message state is encoded into multipartite entangled states. Several identical multi-particle entanglement states are generated and each particle of the entanglement state is filled in different quantum registers which act as shares of the secret message. Two modes, i.e. the detecting mode and the message mode, are employed so that the eavesdropping can be detected easily and the secret message may be recovered. The security analysis shows that the proposed scheme is secure against eavesdropping of eavesdropper and cheating of participants.

A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks

The exactness of sensed data transmission is essential for wireless sensor networks(WSN) applications. Based on clustering WSN architecture, a secure routing protocol with intrusion detection is hereby proposed, wherein an energy prediction model for nodes is used to detect attacks in cluster head election phase, and the key management technique is applied to stage of cluster formation to ensure security of nodes, and a flow prediction model for nodes is used to prevent attacks related with traffic in routing phase. This study aims to improve security of WSN routing protocol. Using NS2 tool, the simulation environment is given. Simulation results show that the proposed protocol can detect and defend against several sophisticated routing attacks such as Sybil, Wormhole, Selective Forwarding and Hello flood attacks.

EZDCP: a new static task scheduling algorithm with edge-zeroing based on dynamic critical paths

A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.

Secure deterministic communication scheme based on quantum remote state preparation

Based on the techniques of the quantum remote state preparation via a deterministic way, this paper proposes a quantum communication scheme to distribute the secret messages in two phases, i.e., the carrier state checking phase and the message state transmitting phase. In the first phase, the secret messages are encoded by the sender using a stabilizer quantum code and then transmitted to the receiver by implementing three CNOT gates. In the second phase, the communicators check the perfectness of the entanglement of the transmitted states. The messages can be distributed to the receiver even if some of the transmitted qubits are destroyed.

USMI: An Ultra-Node Selection Mechanism with Incentive in P2P Network

The performance of P2P networks have decreased severely because of the large number of free-riders. How to incentive nodes to provide service is an important factor to improve the performance of P2P networks. A novel ultra-node selection mechanism with incentive called USMI is presented in this paper. The main contributions of USMI are following: 1) any node in USMI has a value called utility. The utility integrates the parameters including physical capability, voluntary and anticipation to future, differing from the general ultra-node selection which is only based on physical capability and unconsidered free-riding. The ultra-nodes is selected based on the utility value; 2) the ultra-nodes are endow with supervising privilege and they can identify and prevent the free-riders through the parameter of voluntary; 3) the probability of supervising is calculated based on game theory. It’s been shown that USMI increases the total number of file shared, improves the file querying success rate, decreases the average querying hops, and ensures the cost is small at the same time in the Simulation experiments. The ultra-node overlay of USMI is steady and robust.

Improved Analysis of Energy Hole for Wireless Sensor Networks

Through analysis of energy consumption of wireless sensor networks with uniform node distribution, this paper finds that energy hole in the wireless sensor networks with uniform node distribution can not be avoided. When network lifetime ends, as much as 90% of network energy remains. However, network lifetime can increase several times by selecting different transmission power levels. The main conclusions in this paper are presented is that the energy consumption in the same circular ring is nonuniform if the density of sensor nodes in the same circular ring is uniform.

An effective assemble-oriented framework for grid Web service

An effective assemble-oriented framework for grid Web service based on open grid service architecture was proposed, in which Web service semantics network constructed by software reuse was designed to enhance the locating of assemble-oriented service resources. The successful Web services assembled structure was exploited to design semantics network, the logical and the physical structure of the resource was separated in Web service, and the logical resource derived from type ID of Web service was combined with semantic structure. The organizing protocol, data structures and the mechanism of implementation in the model were presented. Experiment results show that the success ratio of Web service request comes to 100% while providing completely assembly semantics set. This model provides guarantee of the reliability of assemble Web service and establishes the foundation of Web service automatic interaction, customizing application service and dynamic service configuration.