scispace - formally typeset
Search or ask a question
Conference

WASE International Conference on Information Engineering 

About: WASE International Conference on Information Engineering is an academic conference. The conference publishes majorly in the area(s): Algorithm design & Interface (computing). Over the lifetime, 649 publications have been published by the conference receiving 2395 citations.

Papers published on a yearly basis

Papers
More filters
Proceedings ArticleDOI
10 Jul 2009
TL;DR: A hybrid PSO (AMPSO) to solve this problem by applying a novel adaptive mutation operator by achieving better results than the standard PSO,PSO with Gaussian mutation and PSO with Cauchy mutation on most test cases.
Abstract: Particle swarm optimization (PSO) has shown its good performance in many optimization problems. However, PSO could often easily fall into local minima because the particles could quickly converge to a position by the attraction of the best particles. Under this circumstance, all the particles could hardly be improved. This paper presents a hybrid PSO (AMPSO) to solve this problem by applying a novel adaptive mutation operator. Experimental results on 8 well-known benchmark functions show that the AMPSO achieves better results than the standard PSO, PSO with Gaussian mutation and PSO with Cauchy mutation on most test cases.

139 citations

Proceedings ArticleDOI
14 Aug 2010
TL;DR: Simulation results show the accuracy of the PV model and the practical value in the algorithm which has better tracking performance and dynamic characteristics, and with the help of embedded MATLAB function the article succeeds to achieve the algorithm.
Abstract: Completing the design for the model of photovoltaic array and achieving to track the array's maximum power point by the help of Incremental Conductance Method. This article firstly introduces a practical model of photovoltaic cells, by which the photovoltaic array`s model is obtained. To achieve the maximum power point tracking the Incremental Conductance method is used. Finally, with the help of embedded MATLAB function the article succeeds to achieve the algorithm. Simulation results show the accuracy of the PV model and the practical value in the algorithm which has better tracking performance and dynamic characteristics.

122 citations

Proceedings ArticleDOI
10 Jul 2009
TL;DR: A new ultralightweight RFID authentication protocol with mutual authentication that requires only simple bit-wise operations and can resist various attacks.
Abstract: Due to the well-developed technology and its variety of applications, the Radio Frequency Identifications (RFIDs) become more and more popular. In many applications such as authentication, the RFID systems need security mechanism to resist all possible attacks and threats. However, most of the security mechanisms always too complex on computation or need large memory space such that they are not suit for low-cost RFIDs. In this paper, we propose a new ultralightweight RFID authentication protocol with mutual authentication. The protocol requires only simple bit-wise operations and can resist various attacks.

41 citations

Proceedings ArticleDOI
10 Jul 2009
TL;DR: In this article, an enhanced LANDMARC system with RSSI was proposed to improve the accuracy of indoor localization by placing the tracking tag and its k nearest reference tags in a set, then repeating to calibrate the target coordinate by the error corrections which obtained by members of this set.
Abstract: This paper aims to locate a tag position inside the building by using low cost device with minimal location error. The enhancement approach with Received Signal Strength Indication (RSSI) technique is proposed to achieve the target. In this paper, after introducing the existing LANDMARC system, we try to construct the relationship between RSSI and distance from Reader to Tag by experiment. Finally, an enhanced approach to reach higher accuracy of indoor localization is proposed. The proposed enhancement approach utilizes the strategy of putting the tracking tag and its k nearest reference tags in a set, then repeating to calibrate the target coordinate by the error corrections which obtained by members of this set. It is a recursive data processing approach. The calibration will continue until the tracking tag’s coordinate tend to be a stable value. Simulation and experimental comparison are also shown here to prove that the accuracy of localization is improved.

41 citations

Proceedings ArticleDOI
Zhibin Zhao1, Bo Wei1, Xiaomei Dong1, Lan Yao1, Fuxiang Gao1 
14 Aug 2010
TL;DR: This paper presents the SA-TC algorithm, based on the on-demand multi-path routings and uses statistical analysis and time constraint to identify the suspected links and shows that it can detect and locate wormhole attacks successfully and efficiently.
Abstract: With the properties of openness and dynamic in topology, wireless sensor networks are challenged with great security threats. In this paper we focus on the wormhole attack which is proved to be particularly dangerous to the resource-limited sensor nodes. We present the SA-TC algorithm for detecting and thus defending against this serious threat. It is based on the on-demand multi-path routings and uses statistical analysis and time constraint to identify the suspected links. It needs neither time synchronization among the sensors nor extra hardwares such as directional antenna and GPS. The simulative experiment shows that SA-TC can detect and locate wormhole attacks successfully and efficiently.

39 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
202311
202218
2010348
2009272