• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1905-1912
• /
• 2009

Clustering results based on the FCM algorithm sometimes produces undesirable clustering result through data distribution in the clustered space because data is classified by comparison with membership degree which is calculated by the Euclidean distance between input vectors and clusters. Symmetrical measurement of clusters and fuzzy theory are applied to the classification to tackle this problem. The enhanced FCM algorithm has a low impact with the variation of changing distance about each cluster, middle of cluster and cluster formation. Improved hybrid network of applying FCM algorithm is proposed to classify patterns effectively. The proposed enhanced FCM algorithm is applied to the learning structure between input and middle layers, and normalized delta learning rule is applied in learning stage between middle and output layers in the hybrid network. The proposed algorithms compared with FCM-based RBF network using Max_Min neural network, FMC-based RBF network and HCM-based RBF network to evaluate learning and recognition performances in the two-dimensional coordinated data.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.27-34
• /
• 2008

Wireless sensor networks are comprised of sensor nodes with resource-constrained hardware. Nodes in the sensor network without adequate protection may be compromised by adversaries. Such compromised nodes are vulnerable to the attacks like false reports injection attacks and false data injection attacks on legitimate reports. In false report injection attacks, an adversary injects false report into the network with the goal of deceiving the sink or the depletion of the finite amount of energy in a battery powered network. In false data injection attacks on legitimate reports, the attacker may inject a false data for every legitimate report. To address such attacks, the probabilistic voting-based filtering scheme (PVFS) has been proposed by Li and Wu. However, each cluster head in PVFS needs additional transmission device. Therefore, this paper proposes a fuzzy logic-based false report detection method (FRD) to mitigate the threat of these attacks. FRD employs the statistical en-route filtering scheme as a basis and improves upon it. We demonstrate that FRD is efficient with respect to the security it provides, and allows a tradeoff between security and energy consumption, as shown in the simulation.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.9
• /
• pp.197-206
• /
• 2020

Collaborative research in science applications based on HPC service needs rapid transfers of massive data between research colleagues over wide area network. With regard to this requirement, researches on enhancing data transfer performance between major superfacilities in the U.S. have been conducted recently. In this paper, we deploy multiple data transfer nodes(DTNs) over high-speed science networks in order to move rapidly large amounts of data in the parallel filesystem of KISTI's Nurion supercomputer, and perform transfer experiments between endpoints with approximately 130ms round trip time. We have shown the results of transfer throughput in different size file sets and compared them. In addition, it has been confirmed that the DTN cluster with three nodes can provide about 1.8 and 2.7 times higher transfer throughput than a single node in two types of concurrency and parallelism settings.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.608-615
• /
• 2006

This paper proposes a fuzzy model tree consisting of local linear models using fuzzy cluster for data modeling. First, cluster centers are calculated by fuzzy clustering method using all input and output attributes. And then, linear models are constructed at internal nodes with fuzzy membership values between centers and input attributes. The expansion of internal node is determined by comparing errors calculated in parent node with ones in child node, respectively. As a final step, data prediction is performed with a linear model having the highest fuzzy membership value between input attributes and cluster centers in leaf nodes. To show the effectiveness of the proposed method, we have applied our method to various dataset. Under various experiments, our proposed method shows better performance than conventional model tree and artificial neural networks.

• Journal of the Korean association of regional geographers
• /
• v.21 no.3
• /
• pp.489-502
• /
• 2015

Sometimes called the Silicon Fen, the Cambridge cluster is well known as the most innovative hi-tech cluster in the world. This paper attempts to explore the evolutionary dynamics of the Cambridge cluster, drawing upon the triple-helix approach. To understand the evolutionary dynamics of the Cambridge cluster, it is important to examine the role and impact of the University of Cambridge, which is conceived as one of the best higher educational institutions in the world. The Cambridge cluster has been evolved on the basis of a strong university-industry relationship. University spin-outs have a long tradition in Cambridge with the history of more than a century, and they have played a critical role in making the cluster more innovative. Business networks and social capital molded for a long time in the region become a foundation for active local spin-out activities. However, since 2000 the central government started steadily to require British universities to be an entrepreneurial university, with the purpose of the reduction of university subsidies. As a result of this, spin-out activities in the Cambridge cluster show a sharp decline, which is a factor of threatening the dynamic evolution of the cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.123-134
• /
• 2008

In this paper, a routing algorithm for wireless sensor networks is proposed to improve the efficiency of energy consumption in sensor nodes. Each sensor node has the value called ‘Flooding Level’ obtained through the initial flooding from a sink node instead of sending beacon messages in multi-hop sensor field. This value can be used for guaranteeing the sensor nodes to connect with a sink node and determining the roles of cluster-head and cluster-gateway node efficiently and simply during the clustering. If different algorithms are added to our protocol, it will work better in the side of energyefficiency. This algorithm is evaluated through analysis and extensive simulations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.109-114
• /
• 2013

In underwater wireless sensor networks, sensing data such temperature and salinity can be merged by averaging them. Data aggregation is a good choice to reduce the amount of packets and save energy in underwater wireless sensor networks. However, data aggregation could bring about packet delay and non-directional transmission to the sink. In this paper, we propose a new path building algorithm based on data aggregation to mitigate these problems. The paper reduces the delay without wireless interferences and maximizes the energy efficiency by removing the non-directional transmission to the sink. Experimental results show that the proposed algorithm outperforms in terms of the energy efficiency and the packet delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.571-573
• /
• 2009

Mobile Ad-hoc Network(MANET) needs efficient node management because the wireless network has energy constraints. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. Previously proposed a hybrid routing CACH prolong the network lifetime and decrease latency. However the algorithm has a problem when node density is increase. In this paper, we propose a new method that the CACHE(Context-aware Clustering Hierarchy and Energy efficient) algorithm. The proposed analysis could not only help in defining the optimum depth of hierarchy architecture CACH utilize, but also improve the problem about node density.