Earticle

Service-oriented computing (SOC) is emerging to be an important computing paradigm of the next future. Based on context awareness, this paper proposes an architecture of SOC. A definition of the context in open environments such as Internet is given, which is based on ontology. The paper also proposes a supporting environment for the context-aware SOC, which focus on services on-demand composition and context-awareness evolving. A reference implementation of the supporting environment based on OSGi[11] is given at last.

Traditionally, the assignment problem between tasks and processors is worked out by scheduling methods. In this paper, we have an innovative idea to construct a problem-solving environment for computational grids. To bridge the gap between the parallel processing technology and the heterogeneous computing environment, the grid computing resources are reorganized architecturally to form a virtual regular topology. In this research, we put emphasis on finding a heuristic algorithm of transferring an irregular grid resource topology into a mesh virtually.

Cloud computing requires scalable and cooperative sharing the resources in various organizations by dynamic configuring a virtual organization according to user’s requirements. Ontology-based representation of Cloud computing environment would be able to conceptualize common attributes among Cloud resources and to describe relations among them semantically. However, mutual compatibility among organizations is limited because a method applying ontology to Cloud is not established yet. We propose to introduce a resource virtualization method using ontology. A new Virtual Ontology (VOn) is configured dynamically based on requirement of users, and the VOn is mapped to Cloud resources. Our service uses a Map/Reduce model for rapid and efficient merging a number of ontology. The execution environment is composed of selected resources on basis of a VOn, which is generated by Ontology Merge engine.

Once a designed network is embedded into a newly designed network, a developed algorithm in the designed network is reusable in a newly designed network. Petersen-Torus has been designed recently, and Hyper Petersen has already been designed as a well-known interconnection network. In this study, it was proven that Hyper Petersen network whose degree increases with the increased number of nodes can be embedded into a Petersen-Torus network having fixed degree. Hyper Petersen was embedded into Petersen-Torus PT(n,n) with expansion 1, dilation 1.5n+2, and congestion 5n. The embedding algorithm was designed for expansion 1, and congestion and dilation are in proportion to O(n) owing to the aspect of Hyper Petersen that the degree increases.

In this paper, we propose a novel tree based routing protocol (TBRP) for prolong the sensor network lifetime. TBRP achieves a good performance in terms of lifetime by balancing the energy load among all the nodes. TBRP introduces a new clustering factor for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely, fuzzy spanning tree for sending aggregated data to the base station. Simulation result show that, when compared other schema TBRP outperforms significantly in optimizing cluster heads energy consumption, amount of data gathered, and Improving system lifetime with acceptable levels of latency in data delivery.