Earticle

Mining association rules refers to extracting useful knowledge from large databases. Algo- rithms of this technique are both data and computation-intensive, which make grid platforms very attractive for them. However, to exploit these platforms, new data partitioning features are required where the specicities of both association rule mining technique and grids must be taken into consideration. In this paper, we propose a novel data partitioning approach for distributed association rule mining algorithms in the context of a grid computing environment. We conduct exper- iments using the French research grid "Grid'5000". Experimental results conrm that our data partitioning approach is very sucient for balancing the load when homogeneous clus- ters are used. For heterogeneous clusters, the proposed data partitioning approach constitute the preprocessing phase of the process of dynamic load balancing of distributed association rule mining.

Complete integration and interaction of network objects can be achieved in a mobile ad-hoc environment. Yet, the dynamic nature of free movement and interaction among these objects also brings challenges on information representation, processing and communication. This paper presents a context-aware mechanism, which is able to implement efficient information exchange and management between nodes in a mobile ad-hoc network (MANET). Rejoining and information loop issues happened heavily in a mobile ad-hoc environment has been discussed in this paper. According to the simulation results, our approach to context-aware management and control makes the information loop problem well controlled.

In this paper, we present a novel performance analysis model for predicting average message latency of hypercube network-on-chip (NoC) systems that employ wormhole switching and fully adaptive routing method with uniformly distributed traffic. Unlike previous works, our model calculates the service rate that is provided by a physical link for the incoming traffic at a particular communicating node by obtaining the reversal service rate that is provided by the downstream nodes, when the network gets saturated. This model has simple closed-form calculations, and can produce accurate analytic results when the NoC system is operating in stable state. The proposed model is validated by comparing the results that are calculated by the model with the results that are obtained through simulations with different network configurations and traffic loads.

In order to provide a highly formalized ontology merging of hierarchical information modeling for distributed management, the Extenics-based approach is introduced to formalize ontology merging of both Management Information Base (MIB) models and MIB instances. The aim of this paper is then to utilize ontology merging at the meta-schema level based on concept lattices to generate semantic models for ontology merging of MIB models using basic-elements in the form of matter-elements, and realize the formal presentation of both MIB instances for ontology merging and implicit knowledge for MIB instances with the use of the extension theory for basic-elements. The proposed Extenics-based ontology merging approach for both MIB models and MIB instances integrates with the former approach for meta-schema based on concept lattices, and aims to promote the formalization level of hierarchical information modeling for distributed management in a unified ontology-driven manner.

In this paper, it is to focus on two areas, primarily data inconsistency problems faced by the mobile database users when they are trying to accessing or updating the database data while mobility in work, in such environment demand for appropriate strategies arises, to overcome this problem. When users come in contact with other network node, updated data is not reflected or propagated at the other sites or nodes, which is previously updated or changed at previous visited site or at activity center. Secondly, require advance replication architecture and effective network protocol based algorithms follows effective replication strategy that securely supports databases changes activities anytime and anywhere in mobile computing network environment.

Advance reservation is an effective technique to realize end-to-end quality of service (QoS) guarantees for grid applications. However, excessive advance reservation will result in low resource utilization and high rejection rate on receiving new requests, which in turn reduces user’s QoS satisfaction. In this paper, a slack reservation strategy is proposed, with aiming to mitigate the negative effects brought about by conventional reservation service. The strategy is based on the observation that applications tend to overestimate reservation deadline to ensure their completion. It allows accepting new reservation requests that overlapping with existing ones under certain conditions. Both the benefits and risks of the proposed policy are presented theoretically. Experimental results show that the strategy can bring about remarkably higher resource utilization and lower rejection rate when the system is in presence of heavy reservation workload.

Wireless sensor networks commonly consist of a large number of tiny sensor nodes that are deployed either inside the target area or very close to it to cooperatively monitor the target area. Energy efficiency and network lifetime are two challenges that most of researchers deal with. In this paper, to improve the performance of sensor networks, we propose an energy-efficient competitive clustering algorithm for wireless sensor networks using a controlled mobile sink. Clustering algorithm can effectively organize sensor nodes and the use of a controlled mobile sink node can mitigate hot spot problem or energy holes. The selection of optimal moving trajectory for sink nodes is an NP-hard problem. In our algorithm, we firstly study an competitive clustering algorithm in which cluster heads are rotated in each round and selected mainly based on their competition range and their residual energy. Besides, we use mobile sink node instead of fixed sink node. The mobile sink node moves at a certain speed along a predefined path and sojourn at some park position to collect data packets. Simulation results validate that competitive clustering algorithm outperforms LEACH and the use of mobile sink node significantly improve the performance of the sensor network.