• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.365-371
• /
• 2012

In recent years, researchers have been attracted to clustering methods to improve communication and data transmission in a network. Compared with traditional wireless networks, wireless sensor networks are energy constrained and have lower data rates. The concept of implementing a clustering algorithm in an existing project on gateway relocation is being explored here. Low energy adaptive clustering hierarchy (LEACH) is applied to an existing study on relocating a gateway. The study is further improved by moving the gateway to a specific cluster based on the number or significance of the events detected. The protocol is improved so that each cluster head can communicate with a mobile gateway. The cluster heads are the only nodes that can communicate with the mobile gateway when it (the mobile gateway) is out of the cluster nodes' transmission range. Once the gateway is in range, the nodes will begin their transmission of real-time data. This alleviates the load of the nodes that would be located closest to the gateway if it were static.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.176-180
• /
• 2008

무선 메쉬 네트워크는 최근 무선 네트워크 환경에서 유선을 효율적으로 연장할 수 있는 기술로서 주목 받고 있으며 무선 백본망을 통해 저렴한 비용으로 광대역 네트워크 인프라를 구성하는 기술이다. 무선 메쉬 네트워크는 기존 네트워크 기술과는 달리 노드의 이동성이 적고 에너지 영향도 덜 제한적인 특징을 가지고 있다. 따라서 이러한 네트워크 특성을 반영할 수 있는 경로 설정 기술이 필요하며 적합한 경로를 결정하기 위한 새로운 라우팅 메트릭이 요구된다. 본 논문에서는 데이터를 효율적으로 전달하기 위해 노드 간 링크 성능과 노드의 부하를 고려한 새로운 라우팅 메트릭을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.855-857
• /
• 2007

In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.185-192
• /
• 2009

In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.80-90
• /
• 2016

Thanks to superior leakage energy efficiency compared to SRAM cells, STTRAM cells are considered as a promising alternative for a memory element in on-chip caches. However, the main disadvantage of STTRAM cells is high write energy and latency. In this paper, we propose a low-cost write filter (WF) cache which resides between the load/store queue and STTRAM-based L1 data cache. To maximize efficiency of the WF cache, the line allocation and access policies are optimized for reducing energy consumption of STTRAM-based L1 data cache. By efficiently filtering the write operations in the STTRAM-based L1 data cache, our proposed WF cache reduces energy consumption of the STTRAM-based L1 data cache by up to 43.0% compared to the case without the WF cache. In addition, thanks to the fast hit latency of the WF cache, it slightly improves performance by 0.2%.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.785-786
• /
• 2006

Recently, Healthcare system has not been standardized and has been developed as an embedded system lacking interoperability. We are finally going to face such problems as having excessive load in using network caused by the uncontrolled spread of system and un-guaranteed interoperability among the heterogenous systems. We suggest the possibility that OSGi (Open Service Gateway initiative : the international standardization of service middleware) can be accepted as a solution for the above problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.369-372
• /
• 2002

본 논문은 대용량 클러스터 기반의 웹 서버를 위한 새로운 내용 기반 부하 분산 기법을 제안한다. 제안된 기법은 웹 서버 로그의 URL 항목에 해시 함수를 적용하여 얻어지는 해시 값에 요청 빈도와 전송될 파일 크기를 누적하여 히스토그램을 생성한다. 그 결과로 생성된 히스토그램의 누적 분포에 히스토그램 균등화 변환함수를 적용하여 각각의 서버 노드에 해시 값에 따라 분포하는 부하를 균등하게 할당할 수 있다. 제안된 부하 분산 기법의 효율성 검증을 위한 시뮬레이션에서 히스토그램 균등화 기법은 서버의 지역적인 캐시 활용과 부하의 균등 분산 등의 장점으로 우수한 성능을 나타냄을 보인다.

• Journal of Korea Multimedia Society
• /
• v.17 no.5
• /
• pp.590-600
• /
• 2014

In the wireless sensor network environment, clustering scheme has a problem that a large amount of energy is unnecessarily consumed because of frequently occurred entire re-clustering process. Some of the studies were attempted to improve the network performance by getting rid of the entire network setup process. However, removing the setup process is not worthy. Because entire network setup relieves the burden of some sensor nodes. The primary aim of our scheme is to cut down the energy consumption through minimizing entire setup processes which occurred unnecessarily. Thus, we suggest a re-clustering scheme that considers event detection, transmitting energy, and the load on the nodes. According to the result of performance analysis, our scheme reduces energy consumption of nodes, prolongs the network lifetime, and shows higher data collection rate and higher data accuracy than the existing schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1223-1225
• /
• 2015

본 논문에서는 여러 과학분야에서 사용되는 대용량 배열 데이터를 병렬처리를 위해 효율적으로 분할하는 기법을 제안한다. 실제 배열 데이터는 희소(sparse) 배열로 구성된 경우가 많아 기존의 chunking 기법을 사용하면 일부 chunk에게만 데이터가 밀집되는 편향 현상이 발생하게 된다. 이러한 문제를 극복하기 위해 본 논문에서는 k-d tree와 유사한 방법으로 공간을 분할하고, 분할된 공간을 chunk로 두는 방법을 제안한다. 제안 방법에 의해 각 chunk는 데이터의 밀집 정도가 비슷하게 되어 효과적인 부하분산(load balancing)이 이루어질 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2443-2449
• /
• 2015

Downlink (DL) data rate for a MS is influenced by not only the signal to interference and noise ratio (SINR) but also the amount of radio resources allocated to the MS. Therefore, when a MS uses SINR to select a cell to associate with, it cannot receive the fastest DL data rate all the time if it associates with a congested cell. Moreover, the SINR-based cell selection may result in cell loads unbalance, which decreases the efficiency of a network. To address the issue, we propose a novel cell selection method by considering not only SINR but also a cell load which are combined into two cell selection criteria. One is the maximum achievable data rate and the other is the minimum outage probability. The simulation results show that the cell selection based on the maximum achievable data rate is superior to the SINR-based method and the method using the minimum outage probability in terms of the system efficiency and the fairness in cell loads while the cell selection method based on the minimum outage probability is superior to the others in terms of the outage probability of a MS.