Showing papers presented at "Parallel and Distributed Computing: Applications and Technologies in 2005"

Energy Adaptive Cluster-Head Selection for Wireless Sensor Networks

Abstract: A wireless network consisting of a large number of small sensors with limited battery power can be an effective tool for gathering data in a variety of environments. Clustering sensors into groups, so that sensors communicate information only to cluster-heads and then the cluster-heads communicate the aggregated information to the base station, may save energy. In this paper, we propose an optimal energyadaptive clustering algorithm which is motivated from the LEACH protocol presented in [4]. We optimize LEACH’s random cluster-head selection algorithm to ensure the balanced energy depletion over the whole network thus prolongs the network lifetime. Simulation results show that our algorithm outperforms LEACH by about 20% to 35% when 1%, 50%, 100% of nodes die for different network sizes and topologies.

RandomWalk Routing for Wireless Sensor Networks

Abstract: Topology is important for any type of networks because it has great impact on the performance of the network. For wireless sensor networks (WSN), regular topologies, which can help to efficiently save energy and achieve long networking lifetime, have been well studied in [1, 4, 5, 7, 9]. However, little work is focused on routing in patterned WSNs except the shortest path routing with the knowledge of global location information. In this paper, we propose a routing protocol based on random walk. It doesn’t require global location information. Moreover, the random walk routing achieves load balancing property inherently for WSNs which is difficult to achieve for other routing protocols. We also prove that the random walk routing consumes the same amount of energy as the shortest path routing in the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes. Since in many applications of WSNs, sensor nodes often send only beeplike small messages to the base station to report their status, our proposed random walk routing is a viable scheme. Though the random walk routing provides load balancing in the WSN, the nodes near to the base station (BS) are inevitably under heavier burden than the nodes far from the base station. Therefore we further propose a density-aware deployment scheme to guarantee that the heavy-load nodes do not affect the network lifetime even if they are exhausted.

Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data

Abstract: For the problem of decision tree classification with privacy concerns, we propose several efficient secure multi-party computation protocols to construct a privacy preserving ID3 algorithm over horizontally partitioned data among multiple parties. Our algorithm presents the first solution to privacy preserving decision tree classification among more than two parties. We also make a performance comparison with the existing solution, which is only applicable to the twoparty case. The result shows that our solution has a significantly better performance.

Trusted Computing-Based Security Architecture For 4G Mobile Networks

Abstract: In this paper security requirements and security architecture for 4G systems are presented with the consideration of Trusted Computing (TC) for mobile equipment (ME). The security framework based on Trusted Mobile Platform (TMP) and PKI is proposed to provide a considerable robust platform for user’s access to sensitive service and data in the scenario of 4G systems. Over this framework, with the combination of password and biometric identification (BI) as well as public key-based identification, an efficient hybrid authentication and key agreement (HAKA) scheme is presented to resist the possible attacks, particularly the attacks on/from ME. Compared with 3G architecture and other security schemes for 4G mobile networks, our architecture and corresponding HAKA is more secure, scalable and convenient to support globe mobility and capable of being employed to handle the complicated security issues in 4G mobile networks.

Dynamic Role and Context-Based Access Control for Grid Applications

Abstract: Despite the recent advances in access control approaches applicable to grid computing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of context-based models for access control, and reliance on identity or capability-based access control schemes. In this paper, we propose RCBAC model which extends the RBAC with context constraints. The RCBAC mechanisms dynamically grant and adapt permissions to users based on a set of contextual information collected from the grid environments, while retaining the advantages of RBAC model.

Delay Character of a Novel Architecture for IEEE 802.16 Systems

Abstract: In this paper, we propose a novel scheduling architecture for IEEE 802.16 broadband wireless access network. Based on the WFQ and WF2Q which play an important role in wired network, we do more deeply research in how integrate these algorithm into IEEE 802.16. Then, a QoS architecture with WFQ algorithm is proposed. A model for our new scheduling structure is built, and the simulations are given. The results show that the delay character is improved using the proposed architecture with the new WFQ algorithm.

Optimization of Intrusion Detection through Fast Hybrid Feature Selection

Abstract: Existing intrusion detection techniques emphasize on building intrusion detection model based on all features provided. But all features are not relevant and some of them are redundant and useless. In this paper, we propose and investigate a fast hybrid feature selection method - a fusion of Correlation-based Feature Selection, Support Vector Machine and Genetic Algorithm - to determine an optimal feature set. An appropriate feature set helps to build efficient decision model as well as reduced feature set lights up the training and testing process considerably. We have examined the feasibility of our approach by conducting several experiments using KDD 1999 CUP intrusion dataset. Experimental results indicate the reduction of training and testing time by an order of magnitude while maintaining the detection accuracy within tolerable range.

A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph

Abstract: A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected. Connected dominating sets have major applications in routing in wireless ad-hoc networks. In this paper, we present a distributed self-stabilizing algorithm for finding a connected dominating set of a graph. Starting from an arbitrary initial state, the algorithm finds a connected dominating set in O(N^2) time, where N is the number of nodes. We also show detailed simulation results to indicate that in practice, the algorithm finds small-sized connected dominating sets in a short time.

Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures

Abstract: This paper describes how to solve very large Traveling- Salesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of parallelizing is a sophisticated Structural Data Parallel approach based on the SPMD model. We distinguish between a non-sophisticated and a sophisticated approach for efficient and simple parallelization of the SOMs.

Monte Carlo Simulation of LEACH Protocol for Wireless Sensor Networks

Abstract: LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and cluster members generated by LEACH are important parameters for achieving better performance. This paper presents a simulation analysis of the statistical characteristics of the numbers of cluster heads and cluster members for LEACH protocol by means of Monte Carlo method. The simulation results have been compared with the analytical results, and coincidence between them has been observed. The results indicate that the numbers of cluster heads and cluster members vary in a not narrow range, and the probability that there is only one cluster head or there is no cluster head is high when the desired value of cluster heads is small.

Wrapping Client-Server Application to Web Services for Internet Computing

Abstract: Legacy systems are valuable assets for organisations. They have been evolving with new emerged technologies in rapidly changing business environment. Web Services technology and Service-Oriented Architectures (SOA) are rapidly developed and widely supported. It is a very efficient way for developers to reuse existing core business in a legacy system. Reengineering a legacy system to provide Web Services is a great challenge. A tool was developed and called Web Services Wrapper (WSW). The WSW is composed of an Analyser and a Wrapper, which focuses on client-server legacy system with Microsoft .Net. A developer can generate Web Services and related source code according to the rules and constraints step by step with the help of WSW.

Intrusion Detection Combining Multiple Decision Trees by Fuzzy logic

Abstract: In order to improve detection performance of data mining-based intrusion detection system, this paper presents a method of combining multiple decision trees based on fuzzy logic, especially the fuzzy integral. The main idea of this method is to divide a great large dataset into several sub-datasets, mine on sub-datasets separately to construct different sub-decision trees, detect TCP data by different sub-decision trees, and then nonlinearly combine the results from multiple sub-decision trees by fuzzy integral. The experiment results show that this technique is superior to individual decision trees for intrusion detection in terms of classification accuracy.

Hamiltonian-like Properties of k-Ary n-Cubes

Abstract: Some Hamiltonian-like properties of k-ary n-cube are explored. In this paper, we show that k-ary 2-cube is almost Hamiltonian-connected, bipanconnected, bipancyclic. And we prove that k-ary n-cube is almost Hamiltonian-connected when n \ge 3 , and Hamiltonianconnected if k is odd.

Using Semantic Web Technologies to Specify Constraints of RBAC

Abstract: Role-based access control (RBAC) models have generated a great interest in the security community as a powerful and generalized approach to security management. One of important aspects in RBAC is constraints that constrain what components in RBAC are allowed to do. There are lots of research have been achieved to specify constraints for secure system developers. However more work is need urgently to met requirements for interoperability of machine and people understandable constraints specification in open and distributed environment. In this paper we propose another approach to specify constraints using Semantic Web technologies. The Web Ontology Language (OWL) specification of basic RBAC components and constraints are described in detail.

Design and Implementation of TIGER Grid: an Integrated Metropolitan-Scale Grid Environment

Abstract: Internet computing and Grid technologies promise to change the way we tackle complex problems. Harnessing these new technologies effectively, it will transform scientific disciplines ranging from highenergy physics to life sciences. This paper describes a metropolitan-scale Grid computing platform named TIGER Project (standing for Taichung Integrating Grid Environment and Resource), which basically interconnects universities and high schools’ cluster computing resources and sharing available resources among them, for investigations in system technologies and high performance applications. This novel project shows the viability of implementation of such project in a metropolitan city.

A Novel Genetic Algorithm for HP Model Protein Folding

Abstract: Determination of the native state of a protein from its amino acid sequence is the goal of protein folding simulations, with potential applications in gene therapy and drug design. To predict a global minimum (GM) structure of a given sequence is a difficult task. A genetic algorithm (GA) is an efficient approach to find lowest-energy conformation for HP lattice model. We have introduced some new operators (symmetric and cornerchange operators) to speed up the searching process and give the result more biology significance. The result shows these new operators improved the success of prediction, compared with standard GA for benchmark HP sequence up to 50 residues

Number and Letter Character Recognition of Vehicle License Plate Based on Edge Hausdorff Distance

Abstract: A new algorithm for recognizing number and letter characters of vehicle license plate is presented. The algorithm uses two steps template matching. First, match the characters based on the foreground match measure, background match measure and the whole mismatch measure respectively. Then, do edge detection operations to the mismatched characters. And finally, match the characters using edge Hausdorff distance. The experimental results show the effectiveness of the algorithm. It not only can identify the similar characters, but also offers robustness to the dirty, broken, distorted characters.

A New Approach of the Vehicle License Plate Location

Abstract: The abstract is to be in fully-justified italicized text, at the top of the left-hand column as it is here, below the author information. Use the word "Abstract" as the title, in 12-point Times, boldface type, centered relative to the column, initially capitalized. The abstract is to be in 10-point, single-spaced type, and up to 150 words in length. Leave two blank lines after the abstract, then begin the main text.

A Watermarking Method Using Quantization and Statistical Characteristics of Wavelet Transform

Abstract: A statistical watermarking method is proposed in this paper. The proposed method uses two dzferent algorithm according to the statistical characteristic of wavelet subbands of m input image. We embed a logo watermark at the middle-frequency band for the robustness of it. The proposed method is a blind scheme, so we need only the watermarked image when the embedded watermark is extracted. We achieved PSNR values around 40dB as shown in the experiment results. It has vely fast processing speed and also robust against attacks.

Optimal Selection of Web Services for Composition Based on Interface-Matching and Weighted Multistage Graph

Abstract: This paper first presents a 3-layer organization model and an evaluation model for services composition. Then it presents an approach for selecting global optimal execution plan of Web services composition, which is based on weighted multistage graph and fully considering interface-matching between Web services. Based on this approach, we can select the optimal execution plan dynamically by Dynamic Programming, Integer Programming, Genetic Algorithm or Immune Algorithm, which can solve the problem efficiently and make the selection more correct.

An Improved Genetic Algorithm For Multi-Objective Optimization

Abstract: The article points out that the traditional methods for multi-objective optimization exist some drawbacks, and presents a new method for multi-objective optimization: Combining genetic search with local search. The improved genetic algorithm (IGA) introduces local search as a means of acceleration and refinement of the solutions of genetic search. The experiments show that the improved genetic algorithm (IGA), compared with the traditional genetic algorithm (GA), can improve efficiency of optimization and ensure a better convergence to the true Pareto optimal front.

A Survey of Mobile Agent-Based Fault-Tolerant Technology

Abstract: This paper surveys the state of the art of agentbased fault tolerance techniques. Existing mobile agent-based fault-tolerant techniques are identified on prevent mobile agents from being blocked by a failure.

Some New Parallel Fast Fourier Transform Algorithms

Abstract: Discrete Fourier transform (DFT) has many applications in digital signal and image processing and other scientific and technological domains, but its time complexity of direct computation is O(n2), limiting greatly its application range. Thus many people have developed fast Fourier transform (FFT) algorithms, reducing the complexity from O(n2) to O(nlogn)(In this paper logn denotes log2n).But for large n, O(nlogn) is still very high. So multiprocessor systems have been used to speed up the computation of DFT. This paper first introduces a new general method to deduce FFT algorithms, then transforms the deduced second radix-2 decimation-in-time FFT algorithm into another parallelizable sequential form, and finally transforms the latter algorithm into a new parallel FFT algorithm, reducing the time complexity of DFT to O(nlogn/p) (where p is the number of processors). Using similar methods, the authors can also design other new parallel 1-D and 2-D FFT algorithms.

Using Dataflow Information to Improve Inter-Workflow Instance Concurrency

Abstract: The control-flow-based design of traditional batch scheduling systems (i.e., Job A must finish before Job B is started) can constrain the concurrency in schedulers for high-performance computing (HPC) workloads. There are two main problems. First, the control-flow graph, representing the workflow, may be inherently limited in its degree of concurrency. Second, if the naming strategy of the input and output files of jobs is simplistic, there may be a filename conflict problem when multiple instances of the same workflow run concurrently.

Genetic Algorithms for Solving Linear Bilevel Programming

Abstract: Bilevel programming, a tool for modelling decentralized decisions, consists of the objectives of the upper level and lower level. And numerous methods are proposed for solving this problem. In this paper, we provide a genetic algorithm method for solving the linear bilevel programming. In our algorithm, we adopted some techniques to guarantee the not only the initial chromosomes but also the chromosomes generated by genetic operators are all feasible, which greatly reduces the searching space and avoiding the difficulty to deal with the infeasible points. Furthermore, it also enhances the efficiency of the algorithm that the best offsprings are selected to replace the parents in operator procedures. Some examples are illustrative to show the feasibility and efficiency of the algorithm proposed in this paper.

Development of an Internet Home Automation System using Java and Dynamic DNS Service

Abstract: This paper presents the design and implementation of an Internet home automation system. The design is based on an embedded controller which is connected to a PC-based home Web server via RS232 serial port. The home appliances are connected to the input/output ports and the sensors are connected to the analog/digital converter channels of the embedded controller. The software of the system is based on the combination of Keil C, Java Server Pages, and JavaBeans, and dynamic DNS service (DDNS) client. Password protection is used to block the unauthorized from accessing to the server. The system is scalable and allows additional appliances to be added to it with no major changes to its core, the home appliances can be monitored and controlled locally, or remotely through a web browser from anywhere in the world provided that an Internet access is available.

A Communication-Induced Checkpointing and Asynchronous Recovery Protocol for Mobile Computing Systems

Abstract: Mobile computing systems have many constraints such as low battery power, low bandwidth , high mobility and lack of stable storage which are not presented in static distributed systems. In this paper, we propose an efficient communication-induced checkpointing protocol for mobile computing systems. We also propose an asynchronous recovery protocol based on the checkpointing protocol. Mobile support stations control major parts of the checkpointing and recovery such as storing and tracing the checkpoints, requesting rollback and logging messages, so that mobile hosts do not incur much overhead. The recovery algorithm has no domino effect and a failed process needs to roll back to its latest checkpoint and request only a subset of the processes to rollback to a consistent checkpoint. Our recovery protocol uses selective message logging at the mobile support station to handle the messages lost due to rollback.

Loop Parallelisation for the Jikes RVM

Abstract: Increasing the number of instructions executing in parallel has helped improve processor performance, but the technique is limited. Executing code on parallel threads and processors has fewer limitations, but most computer programs tend to be serial in nature. This paper presents a compiler optimisation that at run-time parallelises code inside a JVM and thereby increases the number of threads. We show Spec JVM benchmark results for this optimisation. The performance on a current desktop processor is slower than without parallel threads, caused by thread creation costs, but with these costs removed the performance is better than the serial code. We measure the threading costs and discuss how a future computer architecture will enable this optimisation to be feasible in exploiting thread instead of instruction and/or vector parallelism.

Ontology-Based Clustering and Routing in Peer-to-Peer Networks

Abstract: How to improve the performance of content searching in peer-to-peer (P2P) systems is a challenging issue. In this paper we attack this problem by proposing a new decentralized P2P architecture – ontology-based community overlays. The system exploits the semantic property of the content in the network to cluster nodes sharing similar interest together to improve the query and searching performance. Specifically, a distributed hash table (DHT) based overlay is constructed to assist peers organizing into communities. Those peers in the same community form a Gnutella-like unstructured overlay. This architecture helps reduce the search time and decrease the network traffic by minimizing the number of messages propagated in the system. Moreover, it retains the desirable properties of existing unstructured architectures, including being fully decentralized with loose structure, and supporting complex queries. We demonstrate by simulation, that with this architecture, peers can get more relevant resources faster and with less traffic generated.

An Adaptive Advance Reservation Mechanism for Grid Computing

Abstract: Reservation in advance provides a solution for the need of reserving the network resource for future. Advance reservation for global grids becomes an important research area as it allows users to gain concurrent access for their applications to be executed in parallel, and guarantees the availability of resources at specified future times. But performance of reservation for grid was seldom considered. In this paper, an adaptive advance reservation is introduced. It can modify not only the parameters of latest request but also that of admitted requests because sometimes the latest request is fixed with parameters. Particular admission control algorithm for this new type of reservation is provided too. Simulation shows that it can improve performance of resource reservation in terms of both call acceptance rate and resource utilization when the percentage of fixed requests is not very high.