• Title/Summary/Keyword: Station Clustering

Search Result 133, Processing Time 0.026 seconds

A Base Station Clustering Method Based on Sequential Selection Approach (순차적 선택 기반의 전송 기지국 클러스터 형성 방법)

  • Yoo, Hyung-Gil;Sung, Won-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.1-9
    • /
    • 2011
  • In this paper, we propose an efficient method to create clusters of geographically distributed base stations which cooperatively transmit signals in cellular mobile communication systems. The proposed method utilizes a sequential selection approach to choose candidate base stations which can provide maximum weighted sum-rate gain when they participate in the cooperative transmission with the existing cluster. In particular, the proposed method limits the maximum number of base stations in a cluster by considering the system operational and implementation complexities. Moreover, the combinations of clusters dynamically change along with variations of channel environments. Through computer simulations, performance of the proposed method is verified by comparing with the non-cooperative transmission method and the static clustering method. Numerical result shows that the proposed sequential selection based clustering method is especially advantageous for the performance improvement of lower percentile users in terms of average throughput, and thus the proposed method can effectively improve the fairness among users.

ESBL: An Energy-Efficient Scheme by Balancing Load in Group Based WSNs

  • Mehmood, Amjad;Nouman, Muhammad;Umar, Muhammad Muneer;Song, Houbing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4883-4901
    • /
    • 2016
  • Energy efficiency in Wireless Sensor Networks (WSNs) is very appealing research area due to serious constrains on resources like storage, processing, and communication power of the sensor nodes. Due to limited capabilities of sensing nodes, such networks are composed of a large number of nodes. The higher number of nodes increases the overall performance in data collection from environment and transmission of packets among nodes. In such networks the nodes sense data and ultimately forward the information to a Base Station (BS). The main issues in WSNs revolve around energy consumption and delay in relaying of data. A lot of research work has been published in this area of achieving energy efficiency in the network. Various techniques have been proposed to divide such networks; like grid division of network, group based division, clustering, making logical layers of network, variable size clusters or groups and so on. In this paper a new technique of group based WSNs is proposed by using some features from recent published protocols i.e. "Energy-Efficient Multi-level and Distance Aware Clustering (EEMDC)" and "Energy-Efficient Multi-level and Distance Aware Clustering (EEUC)". The proposed work is not only energy-efficient but also minimizes the delay in relaying of data from the sensor nodes to BS. Simulation results show, that it outperforms LEACH protocol by 38%, EEMDC by 10% and EEUC by 13%.

Clustering Triangular Routing Protocol in Wireless Sensor Network (무선 센서 네트워크에서 삼각 클러스터링 라우팅 기법)

  • Nurhayati, Nurhayati;Lee, Kyung Oh;Choi, Sung Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.913-916
    • /
    • 2010
  • Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. TCRP selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments.

Rapid discrimination of commercial strawberry cultivars using Fourier transform infrared spectroscopy data combined by multivariate analysis

  • Kim, Suk Weon;Min, Sung Ran;Kim, Jonghyun;Park, Sang Kyu;Kim, Tae Il;Liu, Jang R.
    • Plant Biotechnology Reports
    • /
    • v.3 no.1
    • /
    • pp.87-93
    • /
    • 2009
  • To determine whether pattern recognition based on metabolite fingerprinting for whole cell extracts can be used to discriminate cultivars metabolically, leaves and fruits of five commercial strawberry cultivars were subjected to Fourier transform infrared (FT-IR) spectroscopy. FT-IR spectral data from leaves were analyzed by principal component analysis (PCA) and Fisher's linear discriminant function analysis. The dendrogram based on hierarchical clustering analysis of these spectral data separated the five commercial cultivars into two major groups with originality. The first group consisted of Korean cultivars including 'Maehyang', 'Seolhyang', and 'Gumhyang', whereas in the second group, 'Ryukbo' clustered with 'Janghee', both Japanese cultivars. The results from analysis of fruits were the same as of leaves. We therefore conclude that the hierarchical dendrogram based on PCA of FT-IR data from leaves represents the most probable chemotaxonomical relationship between cultivars, enabling discrimination of cultivars in a rapid and simple manner.

A Resource Allocation Scheme in Spatial Multiplexing Marine Communication Systems Considering Channel Characteristics (공간 다중화 해양 통신 시스템에서 채널 특성을 고려한 자원 할당 기법)

  • Tcha, Wonjung;Lee, Gilsu;Nam, Yujin;Lee, Seong Ro;Jeong, Min-A;So, Jaewoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.528-537
    • /
    • 2014
  • As the data traffic between ships and a land station continuously increase through the shipbuilding-IT convergence, several wireless communication technologies are being studied to process large amounts of data traffic. In particular, the multi-antenna system is one of the most expected technologies to provide high throughput. This paper proposes an algorithm for the base station to select the ship in consideration of channel characteristics and the transmission angle for a beam of the land station in spatial multiplexing marine communication systems. We increase the system capacity by maximizing the received signal strength of the ship using clustering characteristic of the radio channel. Also, we reduce the time to select the ship by excluding the ship with the large interference between the beams. On our computer simulation, the proposed scheme dramatically reduces the computational complexity with a little sacrifice of the throughput.

Cluster-head-selection-algorithm in Wireless Sensor Networks by Considering the Distance (무선 센서네트워크에서 거리를 고려한 클러스터 헤드 선택 알고리즘)

  • Kim, Byung-Joon;Yoo, Sang-Shin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.127-132
    • /
    • 2008
  • Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

  • PDF

An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks

  • Zhao, Liquan;Chen, Nan
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.500-517
    • /
    • 2017
  • In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

Geographical Patterns of Morphological Variation in Soybean Germplasm

  • Yoon, Mun-Sup;Ahn, Jong-Woong;Park, Sei-Joon;Baek, Hyung-Jin;Park, Nam-Kyu;Rho, Young-Deok
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.45 no.4
    • /
    • pp.267-271
    • /
    • 2000
  • A total of 1,830 soybean collections were grown in the field and characterized for 10 morphological traits to determine the diversity and relationship within and among geographical regions. Phenotypic variation was found within all regions for most characters. The Shannon-Weaver diversity index ranged from 0.49 to 0.62 across regions, and 0.09 to 1.00 across characters. Canonical discriminant analysis and clustering of the canonical means delineated 3 regional clusters: (ⅰ) Kyunggi, Chungchong, Kangwon, Chulla, and Kyungsang; (ⅱ) Heilongjiang; and (ⅲ) Jilin, Manchuria, central China, south China, Others (China), Hokkaido, Honshu, and Others (Japan).

  • PDF

Clustering analysis of Korea's meteorological data (우리나라 기상자료에 대한 군집분석)

  • Yeo, In-Kwon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.5
    • /
    • pp.941-949
    • /
    • 2011
  • In this paper, 72 weather stations in Korea are clustered by the hierarchical agglomerative procedure based on the average linkage method. We compare our clusters and stations divided by mountain chains which are applied to study on the impact analysis of foodborne disease outbreak due to climate change.

A Multi-Chain Based Hierarchical Topology Control Algorithm for Wireless Sensor Networks

  • Tang, Hong;Wang, Hui-Zhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3468-3495
    • /
    • 2015
  • In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.