• 제목/요약/키워드: Energy Tree

검색결과 519건 처리시간 0.024초

에너지 효율적인 모바일 RFID용 태그 충돌방지 프로토콜 (Energy Effective Tag Anti-collision Protocol for Mobile RFID System)

  • 조양현;국중각
    • 한국컴퓨터정보학회논문지
    • /
    • 제17권2호
    • /
    • pp.207-214
    • /
    • 2012
  • 본 논문에서는 Slotted ALOHA, Dynamic Slotted ALOHA, Binary Tree, Query Tree를 분석하고 태그 인식 시간을 단축함으로써 모바일 RFID 환경에서 태그의 인식률을 높인다. 또한 인식시간의 단축을 통해 태그의 반송파 전력을 절약함으로써 보다 안정된 태그의 정보 전송이 가능하도록 한다. 이는 결과적으로 모바일 장치의 배터리 사용시간을 늘려서 서비스 접근도를 향상시킨다. 우리는 논문에서 제안한 에너지 효율적인 모바일 RFID용 태그충돌방지 프로토콜을 제안하였다. 제안 기법은 실험결과에서 태그 인식률, 충돌횟수 그리고 배터리 사용량에 있어서 향상된 결과를 나타내고 있다.

트리기반 색인구조의 분할 방법을 이용한 센서네트워크의 에너지 효율적인 클러스터 생성 방법 (Energy Efficient Clustering Scheme in Sensor Networks using Splitting Algorithm of Tree-based Indexing Structures)

  • 김현덕;유보선;최원익
    • 한국멀티미디어학회논문지
    • /
    • 제13권10호
    • /
    • pp.1534-1546
    • /
    • 2010
  • 센서 네트워크에서는 에너지 소비를 줄이기 위해 다양한 계층적 클러스터링 방법이 제안되었다. 그러나 대부분의 연구에서 나타나는 문제점은 노드의 실제 배치를 생각하지 않고 일방적인 그리드 형태의 구조 또는 무작위 적인 클러스터 구조를 구성하는 것이다. 이렇게 구성된 클러스터는 클러스터의 크기와 포함된 노드의 수가 불균형하기 때문에 큰 에너지 효율을 보이기 힘들다. 그래서 본 논문에서는 실제 노드들이 배치가 된 후 R-Tree의 노드 분할 및 병합 알고리즘에 착안하여 보다 더 효율적인 클러스터를 구성할 수 있는 방법인 CSM(Clustering using Split & Merge algorithm)을 제안한다. 다양한 실험결과 CSM은 기존 방법보다 에너지 효율적인 클러스터링을 생성함으로써 최대 1.6배의 에너지 효율을 보였다.

An Energy Efficient Localized Topology Control Algorithm for Wireless Multihop Networks

  • Shang, Dezhong;Zhang, Baoxian;Yao, Zheng;Li, Cheng
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.371-377
    • /
    • 2014
  • Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

소나무 분진의 최소착화에너지와 폭발한계 측정에 관한 연구 (The Measurement of Minimum Ignition Energy and Explosion Limit for Pine Tree Dust)

  • 최일곤;조일건;목연수;이동훈;최재욱;하동명
    • 한국가스학회지
    • /
    • 제2권2호
    • /
    • pp.55-60
    • /
    • 1998
  • 열경화성 수지의 충전제로 많이 사용되고 있는 소나무 분진을 시료로 분진폭발의 최소착화에너지와 폭발한계를 측정하여 분진폭발 특성을 고찰하였다. 실험은 전극간 거리, 분진운 농도, 분진입도 및 수분 등에 대한 실험을 행하였다. 그 결과 전극간 거리가 4mm 이하로 되면 증가하는 경향을 나타내었으며, 2mm 이하에서는 착화에너지가 갑자기 무한대로 되어 이 값이 한계전극 거리임을 알았다. 또한 분진운 농도가 증가하고 분진 입도가 미세할수록 폭발성이 용이하였으며, 동일한 입도의 분진에서 수분 함유량이 증가할수록 최소착화에너지가 증가하였다.

  • PDF

General Algorithms for Construction of Broadcast and Multicast Trees with Applications to Wireless Networks

  • Nguyen Gam D.
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.263-277
    • /
    • 2005
  • In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

Comparative Genome-Scale Expression Analysis of Growth Phase-dependent Genes in Wild Type and rpoS Mutant of Escherichia coli

  • Oh, Tae-Jeong;Jung, Il-Lae;Woo, Sook-Kyung;Kim, Myung-Soon;Lee, Sun-Woo;Kim, Keun-Ha;Kim, In-Gyu;An, Sung-Whan
    • 한국미생물생명공학회:학술대회논문집
    • /
    • 한국미생물생명공학회 2004년도 Annual Meeting BioExibition International Symposium
    • /
    • pp.258-265
    • /
    • 2004
  • Numerous genes of Escherichia coli have been shown to growth phase-dependent expression throughout growth. The global patterns of growth phase-dependent gene expression of E. coli throughout growth using oligonucleotide microarrays containing a nearly complete set of 4,289 annotated open reading frames. To determine the change of gene expression throughout growth, we compared RNAs taken from timecourses with common reference RNA, which is combined with equal amount of RNA pooled from each time point. The hierarchical clustering of the conditions in accordance with timecourse expression revealed that growth phases were clustered into four classes, consistent with known physiological growth status. We analyzed the differences of expression levels at genome level in both exponential and stationary growth phase cultures. Statistical analysis showed that 213 genes are shown to, growth phase-dependent expression. We also analyzed the expression of 256 known operons and 208 regulatory genes. To assess the global impact of RpoS, we identified 193 genes coregulated with rpoS and their expression levels were examined in the isogenic rpoS mutant. The results revealed that 99 of 193 were novel RpoS-dependent stationary phase-induced genes and the majority of those are functionally unknown. Our data provide that global changes and adjustments of gene expression are coordinately regulated by growth transition in E. coli.

  • PDF

An Optimal Installation Strategy for Allocating Energy Storage Systems and Probabilistic-Based Distributed Generation in Active Distribution Networks

  • Sattarpour, Tohid;Tousi, Behrouz
    • Transactions on Electrical and Electronic Materials
    • /
    • 제18권6호
    • /
    • pp.350-358
    • /
    • 2017
  • Recently, owing to increased interest in low-carbon energy supplies, renewable energy sources such as photovoltaics and wind turbines in distribution networks have received considerable attention for generating clean and unlimited energy. The presence of energy storage systems (ESSs) in the promising field of active distribution networks (ADNs) would have direct impact on power system problems such as encountered in probabilistic distributed generation (DG) model studies. Hence, the optimal procedure is offered herein, in which the simultaneous placement of an ESS, photovoltaic-based DG, and wind turbine-based DG in an ADN is taken into account. The main goal of this paper is to maximize the net present value of the loss reduction benefit by considering the price of electricity for each load state. The proposed framework consists of a scenario tree method for covering the existing uncertainties in the distribution network's load demand as well as DG. The collected results verify the considerable effect of concurrent installation of probabilistic DG models and an ESS in defining the optimum site of DG and the ESS and they demonstrate that the optimum operation of an ESS in the ADN is consequently related to the highest value of the loss reduction benefit in long-term planning as well. The results obtained are encouraging.

무배터리 무선 센서 네트워크에서의 데이터 집적 스케줄링에 관한 새로운 라우팅 구조 방법 (A Novel Routing Structure Method For Data Aggregation Scheduling in Battery-Free Wireless Sensor Networks)

  • ;김문성;추현승
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2022년도 춘계학술발표대회
    • /
    • pp.94-97
    • /
    • 2022
  • The emerging energy harvesting technology, which has been successfully integrated into Wireless Sensor Networks, enables sensor batteries to be charged using renewable energy sources. In the meantime, the problem of Minimum Latency Aggregation Scheduling (MLAS) in battery-powered WSNs has been well studied. However, because sensors have limited energy harvesting capabilities, captured energy is limited and varies greatly between nodes. As a result, all previous MLAS algorithms are incompatible with Battery-Free Wireless Sensor Networks (BF-WSNs). We investigate the MLAS problem in BF-WSNs in this paper. To make the best use of the harvested energy, we build an aggregation tree that leverages the energy harvesting rates of the sensor nodes with an intuitive explanation. The aggregation tree, which determines sender-receiver pairs for data transmission, is one of the two important phases to obtain a low data aggregation latency in the BF-WSNs.