Work place: Shandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center, Jinan, China
E-mail: wangyl@keylab.net
Website:
Research Interests: Information-Theoretic Security, Network Security, Network Architecture, Information Security, Computer Architecture and Organization
Biography
Ying-long WANG, born in 1965, received his master degree in industrial automation from Shandong University of Technology (Shandong University now) in 1995, and doctor degree in communication and information systems from Shandong University in 2005. He is a fellow in Shandong Academy of Sciences.
His research interests include wireless network, information security, and cloud computing etc.
By Huan-Qing CUI Ying-Long WANG Qiang GUO Nuo WEI
DOI: https://doi.org/10.5815/ijcnis.2010.01.07, Pub. Date: 8 Nov. 2010
Localization is one of the most important technologies in wireless sensor network, and mobile beacon assisted localization is a promising localization method. The mobile beacon trajectory planning is a basic and important problem in these methods. There are many obstacles in the real world, which obstruct the moving of mobile beacon. This paper focuses on the obstacle avoidance trajectory planning scheme. After partitioning the deployment area with fixed cell decomposition, the beacon trajectory are divided into global and local trajectory. The approximate shortest global trajectory is obtained by depth-first search, greedy strategy method and ant colony algorithm, while local trajectory is any existing trajectories. Simulation results show that this method can avoid obstacles in the network deployment area, and the smaller cell size leads to longer beacon trajectory and more localizable sensor nodes.
[...] Read more.By Shujiang Xu Ying-Long WANG Yucui Guo Cong Wang
DOI: https://doi.org/10.5815/ijigsp.2010.01.08, Pub. Date: 8 Nov. 2010
Only by means of XOR operation, a novel image encryption scheme is proposed based on a nonlinear chaotic map (NCM). There are two rounds in the proposed image encryption scheme. In each round of the scheme, the pixel gray values are modified from the first pixel to the last pixel firstly, and then the modified image is encrypted from the last pixel to the first pixel in the inverse order. In order to accelerate the encryption speed, every time NCM is iterated, n (n>3) bytes random numbers which are used to mask the plain-image can be gained. And to enhance the security, a small perturbation will be given to the parameters of the NCM based on the last obtained n bytes modified elements before next iteration. Experimental results and theory analysis show that the algorithm has a high security performance and a good efficiency.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals