Time filter

Source Type

Jian G.,Beihang University | Yi Z.,Institute of Wuhan Digital Engineering
2010 WRI International Conference on Communications and Mobile Computing, CMC 2010 | Year: 2010

A multicast routing algorithm is proposed with multiple constraints based on mobile agents. In this algorithm, source nodes utilize the information in node cache to create multicast trees with constraints on bandwidth and power. The QoS strategy extends the survival time of network. When links fail during data transmission, the algorithm will repair the original path locally rather than reroute the data, which will effectively reduce the probability of data retransmission and rerouting. We conduct experiments with network simulators to evaluate the performance of the algorithm. The experimental results show that our algorithm is more effective and robust than MAODV. © 2010 IEEE.

Hsu C.-F.,Central China Normal University | Zeng B.,South China University of Technology | Cheng Q.,Institute of Wuhan Digital Engineering
Journal of Communications and Networks | Year: 2013

Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. In this paper, an access structure can be represented by a label graph G, where a vertex denotes a participant and a complete subgraph of G corresponds to a minimal authorized subset. The vertices of G are labeled into distinct vectors uniquely determined by the maximum prohibited structure. Based on such a label graph, a verifiable secret sharing scheme realizing general access structures is proposed. A major advantage of this scheme is that it applies to any access structure, rather than only structures rep-resentable as previous graphs, i.e., the access structures of rank two. Furthermore, verifiability of the proposed scheme can resist possible internal attack performed by malicious participants, who want to obtain additional shares or provide a fake share to other participants. © 2011 JCN.

Zhang B.,Institute of Wuhan Digital Engineering | Yu X.,Wuhan University
Proceedings of SPIE - The International Society for Optical Engineering | Year: 2015

Hyperspectral image visualization reduces high-dimensional spectral bands to three color channels, which are sought in order to explain well the nonlinear data characteristics that are hidden in the high-dimensional spectral bands. Despite the surge in the linear visualization techniques, the development of nonlinear visualization has been limited. The paper presents a new technique for visualization of hyperspectral image using t-distributed stochastic neighbor embedding, called VHI-tSNE, which learns a nonlinear mapping between the high-dimensional spectral space and the three-dimensional color space. VHI-tSNE transforms hyperspectral data into bilateral probability similarities, and employs a heavy-tailed distribution in three-dimensional color space to alleviate the crowding problem and optimization problem in SNE technique. We evaluate the performance of VHI-tSNE in experiments on several hyperspectral imageries, in which we compare it to the performance of other state-of-art techniques. The results of experiments demonstrated the strength of the proposed technique. © 2015 SPIE.

Hsu C.-F.,Huazhong University of Science and Technology | Cui G.-H.,Huazhong University of Science and Technology | Cheng Q.,Institute of Wuhan Digital Engineering | Chen J.,Wuhan University
Journal of Network and Computer Applications | Year: 2011

Wireless mesh networks (WMNs) have emerged as an increasingly important technology that offers low-cost community wireless services. The community-oriented nature of WMNs facilitates group applications, such as webcast, distance learning, online gaming, video conferencing, and multimedia broadcasting. Security is critical for the deployment of these services. Secure group communication has become an important component in WMNs. In order to provide secure and efficient group communication in WMNs, in this paper we consider an ideal linear multi-secret sharing scheme, in which each authorized subset may have different target secret. In particular, we put forward a general method of construction for such a scheme by using monotone span programs. The correctness and security of proposed scheme are proved. © 2010 Elsevier Ltd. All rights reserved.

Zhu Z.,Huazhong University of Science and Technology | Zhu Z.,Institute of Wuhan Digital Engineering
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | Year: 2010

An dynamic nonlinear transform algorithm is propsoed based on the theory of random walking on the symmetric group. From this algorithm, an S-box which is used to transform and improve the output sequence generated by chaos-based pseudorandom sequence generator is built. Furthermore, a novel chaos-based pseudorandom sequence generator is introduced. The shortest period of the output sequence is proved. Some properties of the sequences from the pseudorandom sequence generators wered derived, which demonstrated that the sequences are independent and identically distributed. Moreover, the performance of these proposed generators are more complicated than the performance of the pseudorandom sequence generator based on the model of coding chaotic orbits in the sense of complexity measure by using the symbolic dynamical methods.

Hsu C.-F.,Huazhong University of Science and Technology | Cheng Q.,Institute of Wuhan Digital Engineering | Tang X.,Huazhong University of Science and Technology | Zeng B.,Huazhong University of Science and Technology
Information Sciences | Year: 2011

A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1, ... , sm among a set of n participants. In this paper, we propose an ideal linear multi-secret sharing scheme, based on monotone span programs, where each subset of the set of participants may have the associated secret. Our scheme can be used to meet the security requirement in practical applications, such as secure group communication and privacy preserving data mining etc. We also prove that our proposed scheme satisfies the definition of a perfect multi-secret sharing scheme. © 2010 Elsevier Inc. All rights reserved.

Han S.,Institute of Wuhan Digital Engineering | Zhang Q.,Institute of Wuhan Digital Engineering | Chen Z.,Institute of Wuhan Digital Engineering
Advanced Materials Research | Year: 2013

For the requirements of nitric oxide (NOx) and sulfur dioxide (SO2) removal process in coal-fired power plant, a new non-thermal plasma system combined with catalyst was developed to investigate the effect of parameters such as temperature, atmosphere, residence time, and additives (NH3 and methanol) on NOx and SO2 conversion rate. The results indicated that the new system could greatly promote the NOx conversion rate while it only had a slight influence on the SO2 oxidization rate. Meanwhile, high temperature suppressed the NO oxidization, and promoted the SO2 oxidation. The long residence time was beneficial to the NOx and SO2 oxidization. In the absence of water, the additive of NH3 can improve NO, NOx, and SO2 oxidization rate due to the reactions between NH3 and NOx, or SO2. Contrary to NH3, methonal had a negative effect on NOx and SO2 oxidization. © (2013) Trans Tech Publications, Switzerland.

Yin Y.,Institute of Wuhan Digital Engineering | Cheng H.,Institute of Wuhan Digital Engineering
Lecture Notes in Electrical Engineering | Year: 2012

Congestion in wireless sensor networks (WSNs) not only affects transmission reliability, and will waste valuable energy resources. In order to reduce the wireless sensor networks routing instability, a congestion avoidance and alleviation (CAA) routing protocol. In this work, we address the problem of congestion in the sensor networks. Our primary objective in using this approach is to adaptively detect the potential congestion timely and effective; make data packet arrival rate in the nodes equal to packet service rate, so that the occurrence of congestion in the nodes is seamlessly avoided. Once congestion happens inevitably, CAA is presented to reallocate traffic with altering route protocol to mitigate congestion, avoid conflict, enhances data transmission reliability of CH; Congestion data local preservation strategies, it effectively avoid data lost during the congestion period and guarantee the reliability of data transmission . The results shows have shown that the proposed algorithm is capable of successfully avoiding congestion requiring reliable networks. © 2012 Springer-Verlag GmbH.

Zhu Z.,Institute of Wuhan Digital Engineering
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings | Year: 2010

A highly robust chaotic synchronization scheme is proposed in this paper. Different from most synchronization scheme, the two continuous chaotic systems is not driven by each other, but the separated standard digital chaotic systems. Since the digital chaotic systems are not affected by the internal noise and external noise, our synchronization scheme is much more robust than other synchronization schemes. Based on this synchronization scheme, a chaos-based secure communication system is designed. We use return-map and spectrum to analyze the security of our system. Simulation results shows that our system is highly security.

Zhang Y.,Institute of Wuhan Digital Engineering | Zhang X.,Institute of Wuhan Digital Engineering
Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering) | Year: 2011

This paper presents an intrusion detection system based on mobile Agent for mobile ad hoc Networks. We introduce the basic algorithm, the system structure and the working theory of the intrusion detection system. The best route can be gotten by the routing algorithm. Learning from the local observed behavior and the neighbor reported behavior, if the rating of malicious behavior exceeds a threshold, the local node send the alert message and use the spare routing. Collecting the alert message from the other nodes, the node concludes the decision and deletes the malicious node from the network. We have done the experiment in simulated environment of NS2 system. We simulate malicious behavior as the black hole and the worm hole. The simulated results show that, the intrusion detection system is very efficient and robust.

Loading Institute of Wuhan Digital Engineering collaborators
Loading Institute of Wuhan Digital Engineering collaborators