• Title/Summary/Keyword: 기지국 클러스터

Search Result 49, Processing Time 0.031 seconds

A Cluster Based Cooperative Diversity Scheme for a Multi-user Uplink Channel (다중 사용자 상향링크 채널을 위한 클러스터 기반 협동 다이버시티 기법)

  • Kim, Jin-Su;Lee, Jae-Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2008.11a
    • /
    • pp.103-105
    • /
    • 2008
  • 차세대 양방향데이터방송 (BIFS: BInary Format for Scenes) 서비스에서는 하향링크(downlink) 데이터 전송률에 상응하는 높은 상향링크(uplink) 데이터 전송률이 요구되고 있다. 이에 무선 전송 채널의 한정된 자원 환경 속에서 상향링크 전송용량 증대를 위한 주파수 효율성 제고 기술의 필요성이 대두되고 있다. 본 논문에서는 차세대 양방향데이터방송을 위한 다중 모바일(mobile) 사용자의 클러스터(cluster) 기반 상향링크 협동 다이버시티(cooperative diversity) 기법을 제안한다. 제안된 기법은 하나의 단일 안테나(single antenna) 방송 기지국과 다수의 단일 안테나 모바일 사용자가 있는 상향링크 시분할다중접속 (TDMA: Time Division Multiple Access) 시스템에서 데이터 지연허용(delay-tolerant)에 따라 클러스터를 구성하고 제곱 다이버시티 차수(square diversity order)의 협동 프로토콜(cooperative protocol)을 통해 높은 공간다이버시티 이득(spatial diversity gain)을 얻는다. 또한, 비대칭(asymmetric) 무선 채널 환경에서 공정성(fairness)을 보장한다.

  • PDF

An Energy Saving Method using Hierarchical Filtering in Sensor Networks (센서 네트워크에서 계층적 필터링을 이용한 에너지 절약 방안)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.4
    • /
    • pp.768-774
    • /
    • 2007
  • This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network. This study proposes hierarchical filtering for reducing the sensor's energy dissipation. Hierarchical filtering is to divide sensor network by two tiers when filtering it. First tier performs filtering when transmitting the data from cluster member to cluster head, and second tier performs filtering when transmitting the data from cluster head to base station. This should increase the efficiency of filtering and decrease the inaccuracy of the data compared to the methods which enlarge the filter width to do more filtering.

  • PDF

A Study on a Clustering for Military Tactical Information Communication Network (군 전술정보통신체계에서 클러스터 구조에 대한 연구)

  • Lee, Myung-Noh;Yoo, Jae-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.709-712
    • /
    • 2010
  • A military tactical information communication network uses no base station and all mobile terminal are independent while mobile networks use an infra structure that a fixed base station supports many mobile terminals. A clustering system is more efficient than the existing one in small Ad-hoc network using a limited message size. The development of an adaptive clustering algorithm is necessary to maximize the network efficiency via a study on a clustering for military tactical information communication network.

  • PDF

Cluster Head Selection Protocol Using Modified Setup Phase (변형된 셋업 단계를 이용한 클러스터 헤드 선출 프로토콜)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.167-176
    • /
    • 2009
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

An Adaptive Clustering Algorithm of Wireless Sensor Networks for Energy Efficiency (에너지 효율을 위한 무선센서 네트워크의 적응형 클러스터링 알고리즘)

  • Cho, Young-bok;Lee, Sang-ho;Woo, Sung-Hee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.99-106
    • /
    • 2017
  • In the WSN environment, the sensor node is selected as the cluster header and consumes a lot of energy. Therefore, we proposed a method to automatically select a cluster algorithm using the sensor field environment that can improve the reliability of the whole network by applying an energy efficient clustering algorithm based on already deployed sensor field. Experimental results show that FDN is extended about 3 times by using the proposed algorithm. In addition, the network energy is extended by up to 30% compared to the conventional method, thereby improving the reliability of the sensor network.

Scheduling Model for Centralized Unequal Chain Clustering (중앙 집중식 불균등 체인 클러스터링을 위한 스케줄링 모델)

  • Ji, Hyunho;Baniata, Mohammad;Hong, Jiman
    • Smart Media Journal
    • /
    • v.8 no.1
    • /
    • pp.43-50
    • /
    • 2019
  • As numerous devices are connected through a wireless network, there exist many studies conducted to efficiently connect the devices. While earlier studies often use clustering for efficient device management, there is a load-intensive cluster node which may lead the entire network to be unstable. In order to solve this problem, we propose a scheduling model for centralized unequal chain clustering for efficient management of sensor nodes. For the cluster configuration, this study is based on the cluster head range and the distance to the base station(BS). The main vector projection technique is used to construct clustering with concentricity where the positions of the base stations are not the same. We utilize a multiple radio access interface, multiple-input multiple-output (MIMO), for data transmission. Experiments show that cluster head energy consumption is reduced and network lifetime is improved.

Joint Cell Grouping and User Association Scheme for Clustered Heterogeneous Cellular Networks (클러스터 이기종 셀룰러 네트워크를 위한 합동 셀 그룹핑 및 사용자 접속 기법)

  • Park, Jin-Bae;Lee, Hyung Yeol;Choi, Uri;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.6
    • /
    • pp.520-527
    • /
    • 2013
  • In this paper, a joint cell grouping and user association technique proposed for a semi-dynamic grouped network MIMO in a clustered heterogeneous cellular network (HCN). With the conventional macro BSs, small cells are being overlaid to increase a spectral efficiency per area and these small cells are expected to be concentrated to support exponentially increasing data traffic in hot spot areas. The main culprits of performance degradation in the clustered HCN are interference and load imbalance. The proposed scheme jointly handles them to maximize a proportional-fair metric. It is shown that the proposed technique can largely improve user average rate and proportional fairness among users than any other conventional schemes in the clustered HCN.

A Study on the Energy Efficient Data Aggregation Method for the Customized Application of Underwater Wireless Sensor Networks (특정 응용을 위한 수중센서네트워크에서 에너지 효율적인 데이터통합 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong;Yu, Hyung-Cik
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1438-1449
    • /
    • 2011
  • UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.

An Energy Consumption Model using Hierarchical Unequal Clustering Method (계층적 불균형 클러스터링 기법을 이용한 에너지 소비 모델)

  • Kim, Jin-Su;Shin, Seung-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.6
    • /
    • pp.2815-2822
    • /
    • 2011
  • Clustering method in wireless sensor networks is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. In this paper, I propose the hierarchical unequal clustering method using cluster group model. This divides the entire network into two layers. The data aggregated from layer 2 consisted of cluster group is sent to layer 1, after re-aggregation the total data is sent to base station. This method decreases whole energy consumption by using cluster group model with multi-hop communication architecture. Hot spot problem can be solved by establishing unequal cluster. I also show that proposed hierarchical unequal clustering method is better than previous clustering method at the point of network energy efficiency.

Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks (무선 센서 네트웍에서 에너지 효율적인 집단화를 위한 경험적 백트랙 탐색 알고리즘)

  • Sohn, Surg-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.219-227
    • /
    • 2008
  • As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

  • PDF