The last wave of EU enlargement ended on 1 January 2007 with the accession of Romania and Bulgaria. Many countries of the South-Eastern Europe aspire to join the EU. Croatia appears to be the next prospective member, so the aim of this paper was to classify Croatia and EU 27 Member States according to the structural economic indicators. These countries were gathered into homogenous groups in te...

The main issue in WSN is energy limited characteristic of the sensor node. So the problem is to have the routing protocol in such the manner that it should be energy efficient in order to increase the life time of the whole WSN. Hierarchical routing architecture divides the whole network in to a group of cluster and only cluster head is responsible to forwarding the data to base station directl...

The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster....

In this paper we propose a new bidirectional hierarchical clustering system for addressing challenges of web mining. The key feature of our approach is that it aims to maximize the intra-cluster similarity in the bottom-up cluster-merging phase and it ensures to minimize the inter-cluster similarity in the top-down refinement phase. This two-pass approach achieves better clustering than existin...

Heterogeneous cluster-based wireless sensor networks (WSN) attracted increasing attention recently. Obviously, the clustering makes the entire networks hierarchical; thus, several kinds of keys are required for hierarchical network topology. However, most existing key management schemes for it place more emphasis on pairwise key management schemes or key predistribution schemes and neglect the ...

In hierarchical cluster analysis dendrogram graphs are used to visualize how clusters are formed. Because each observation is displayed dendrograms are impractical when the data set is large. For non-hierarchical cluster algorithms (e.g. Kmeans) a graph like the dendrogram does not exist. This paper discusses a graph named “clustergram” to examine how cluster members are assigned to clusters as...

In this paper, an efficient Fibonacci series based hierarchical protocolHFTM (Hierarchical Fibonacci Tree Multicast) is proposed for applicationlayer multicast. It adopts the idea of layer and cluster to construct multicast group members into a hierarchical architecture. During the cluster formation, it considers the underlying network properties to reduce packet delivering on costly links. In ...