• Title/Summary/Keyword: Cluster-Based

Search Result 4,032, Processing Time 0.032 seconds

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI;T. NITHIYA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.861-868
    • /
    • 2023
  • Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

Practical Data Transmission in Cluster-Based Sensor Networks

  • Kim, Dae-Young;Cho, Jin-Sung;Jeong, Byeong-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.224-242
    • /
    • 2010
  • Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

VIA-Based PC Cluster System for Efficient Information Retrieval (효율적인 정보 검색을 위한 VIA 기반 PC 클러스터 시스템)

  • Kang, Na-Young;Chung, Sang-Hwa;Jang, Han-Kook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.10
    • /
    • pp.539-549
    • /
    • 2002
  • PC cluster-based Information Retrieval (IR) systems improve their performances by parallel processing of query terms using cluster nodes. However TCP/IP based communication used to exchange data between cluster nodes prevents the performance from being improved further. The user-level communication mechanisms solve the problem by eliminating the time-consuming kernel access in exchanging data between cluster nodes. The Virtual Interface Architecture (VIA) is one of the representative user-level communication mechanisms which provide low latency and high bandwidth. In this paper, we propose a VIA-based parallel IR system on a PC cluster. The IR system is implemented using the following three communication methods: Sealable Coherent Interface (SCI) based VIA, MPI on SCI based VIA, MPI on Fast Ethernet based VIA. Through experiments, the performances of the three methods are analyzed in various aspects.

National-Wide NETPPI-LT Cluster Design using CORS (상시기준국을 이용한 정밀위치결정 인프라 클러스터 전국단위 설계)

  • Shin, Miri;Ahn, Jongsun;Son, Eunseong;Heo, Moon-Beom
    • Journal of Advanced Navigation Technology
    • /
    • v.22 no.6
    • /
    • pp.577-584
    • /
    • 2018
  • GNSS based transport infrastructure cluster is to broadcast satellite navigation correction information and integrity information capable of precise positioning for land transport users. This makes it possible to do lane-level positioning reliably. However, in order to provide the lane-level positioning and correction information service nationwide, new station sites selection and to build GNSS stations have a heavy cost and a burden for a considerable period of time. In this paper, we propose the cluster design criteria and national-wide network-based precise positioning for land transportation (NETPPI-LT) cluster design for a cluster-based precise positioning. Furthermore, it is analyzed the precise positioning pre-performance of this cluster design based on the spatial error and verified its suitability as the precise positioning pre-performance of the cluster design.

Avoiding Energy Holes Problem using Load Balancing Approach in Wireless Sensor Network

  • Bhagyalakshmi, Lakshminarayanan;Murugan, Krishanan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1618-1637
    • /
    • 2014
  • Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

A Study on the Establishment of Port Cluster in Korea (우리나라 항만클러스터 구축방안에 관한 연구)

  • 한철환
    • Journal of Korea Port Economic Association
    • /
    • v.19 no.1
    • /
    • pp.1-22
    • /
    • 2003
  • Recently, the cluster-based industrial policy has become a powerful policy tool for strengthening the competitiveness of nations, industries and firms. The concept of cluster develops as firms choose to locate in each others proximity. Cluster concept can be usefully applied to analyze cluster of port-related activities. Port cluster can be used as a systematic foundation for providing one-stop value added logistics service to its customers. The main purpose of this paper is to suggest a way for establishing the port cluster in Korean seaport. For this aim, the paper defines a concept of port cluster and examines the its necessity. And the procedure for establishment of port cluster in Korea is proposed. In addition, the paper analyzed the port cluster structure-conduit-performance. Especially, the role of port cluster's participants, central and local government, universities and related R&D institutes, and private companies, are suggested respectively. As a conclusion, policy suggestions for the establishment of port cluster in Korea are suggested.

  • PDF

Design and Implementation of WMI based VOD Service for efficient Load Balance Policy (효율적인 부하 분산 정책을 위한 WMI 기반 VOD 서비스의 설계 및 구현)

  • Bang, Han-Min;Jung, In-Bum
    • Journal of Industrial Technology
    • /
    • v.29 no.A
    • /
    • pp.123-126
    • /
    • 2009
  • Cluster-based servers are utilized for large scale streaming services. These servers show good performance under fair resource usage balance policies between backend nodes. In this paper, cluster-based VOD servers are implemented based on WMI functions. Based on these functions, the information of resource usages in backend nodes can be exchanged and also the working states of cluster nodes can be monitored periodically. In experiences, we find motivations to design an effective load balancing policy. In addition, to provide reliable streaming services, the method to detect a partial failure in cluster-based servers is proposed.

  • PDF

An Efficient Cluster header Election Scheme Using Remain Energy in Ad hoc network (Ad hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤드 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.224-227
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

  • PDF

Study of galaxies in extensive area of the Virgo cluster

  • Kim, Suk;Rey, Soo-Chang;Sung, Eon-Chang;Jerjen, Helmut;Lisker, Thorsten;Lee, Youngdae;Chung, Jiwon;Lee, Woong;Chung, Aeree;Yoon, Hyein
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.1
    • /
    • pp.35.1-35.1
    • /
    • 2016
  • Nearby galaxy clusters and their surrounding regions represent the current endpoint of evolution galaxy cluster evolution. We present a new catalog of 1589 galaxies, what we call Extended Virgo Cluster Catalog (EVCC), in wider area of the Virgo cluster based on the Sloan Digital Sky Survey (SDSS) Data Release 7. The EVCC covers an area 5.2 times larger than the footprint of the classical Virgo Cluster Catalog, and reaches out to 3.5 times the virial radius of the Virgo cluster. The EVCC contains fundamental information such as membership, morphology, and photometric parameters of galaxies. The EVCC defines a comprehensive galaxy sample covering a wider range in galaxy density that is significantly different from the inner region of the Virgo cluster. It will be the foundation for forthcoming galaxy evolution studies in the extended Virgo cluster region, complementing ongoing and planned Virgo cluster surveys at various wavelengths. We also present the large scale structures in the field around the Virgo cluster. We identified seven galaxy filaments and one possible sheet in three dimensions of super-galactic coordinates based on the HyperLEDA database. By examining spatial distribution and Hubble diagram of galaxies, we found that six filaments are directly associated with the main body of the Virgo cluster. On the other hand, one filament and one sheet are structures located at background of the main body of Virgo cluster. The EVCC and the filament structures will be the foundation for forthcoming studies of galaxy evolution in various environments as well as buildup of the galaxy cluster at z ~ 0, complementing ongoing and planned Virgo cluster surveys at various wavelengths.

  • PDF

Distributed and Weighted Clustering based on d-Hop Dominating Set for Vehicular Networks

  • Shi, Yan;Xu, Xiang;Lu, Changkai;Chen, Shanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1661-1678
    • /
    • 2016
  • Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.