Solving Reliable OCST Problems through Spanning Tree-Based Genetic Algorithm

As our interest in the implementation of the ubiquitous computing environments has been aroused, the recent explosively increasing attraction on communication network systems has been driving the theory and the technology of the related files. Especially, the optimal communication spanning tree (OCST) problem is the famous application of the communication network system problems. This OCST problem can be applied in the many network optimization problems, such as network topology design problems, multicast tree configuration problems, and ad-hoc network or ubiquitous sensor network routing problems, and so forth. Recently, the more concern about the reliable network systems have been increasing, in order to provide the various services and contents requested from the users in communication network systems. This paper presents a genetic algorithm with the proposed encoding method based on Prufer number (PN) and a clustering string, to solve the reliable OCST problems. Finally, we will see clearly that our proposed method is efficient and effective algorithm and can be employed as the solution method of the reliable OCST problems from several experimental results.