• Title/Summary/Keyword: Node Management

Search Result 1,125, Processing Time 0.026 seconds

Embedded Node Cache Management for Hybrid Storage Systems (하이브리드 저장 시스템을 위한 내장형 노드 캐시 관리)

  • Byun, Si-Woo;Hur, Moon-Haeng;Roh, Chang-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.157-159
    • /
    • 2007
  • The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

  • PDF

An Efficient Movement Management Method of Mobile Node in Mobile IPv6 (Mobile IPv6환경에서 이동노드의 효율적인 위치 관리 방안)

  • Shin Chung-Soo;Mun Young-Song
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.211-218
    • /
    • 2006
  • The Mobile IPv6 provides the enhanced internet services to user by supporting a node's mobility. In Mobile IPv6(MIPv6), the mobile node sends the binding message which binds home address(HoA) with care-of address(CoA) to the home agent whenever it changes its point of attachment to the internet. To reduce the mobility management signal message the Paging Hierarchical Mobile IPv6(PHMIPv6) is proposed. The mobile node does not send the binding message within the domain if the mobile node's state is idle. Therefore the mobility signal message cost can be reduced. However, when the mobile node's session arrival rate is high the many mobility management signal cost are needed because the paging cost is very high. In this paper, we analysis the drawback of PHMIPv6 and propose the scheme which can reduce the mobility management signal cost. The proposed scheme works independent of the number of subnet in the domain. Therefore the proposed scheme can improve the mobile node's mobility management scheme.

Load Balancing Method for Query Processing Based on Cache Management in the Grid Database (그리드 데이터베이스에서 질의 처리를 위한 캐쉬 관리 기반의 부하분산 기법)

  • Shin, Soong-Sun;Back, Sung-Ha;Eo, Sang-Hun;Lee, Dong-Wook;Kim, Gyoung-Bae;Chung, Weon-Il;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.914-927
    • /
    • 2008
  • Grid database management systems are used for large data processing, high availability and data integration in grid computing. Furthermore the grid database management systems are in the use of manipulating the queries that are sent to distributed nodes for efficient query processing. However, when the query processing is concentrated in a random node, it will be occurred with imbalance workload and decreased query processing. In this paper we propose a load balancing method for query processing based on cache Management in grid databases. This proposed method focuses on managing a cache in nodes by cache manager. The cache manager connects a node to area group and then the cache manager maintains a cached meta information in node. A node is used for caching the efficient meta information which is propagated to other node using cache manager. The workload of node is distributed by using caching meta information of node. This paper shows that there is an obvious improvement compared with existing methods, through adopting the proposed algorithm.

  • PDF

A Study on Secure Cooperative Caching Technique in Wireless Ad-hoc Network (Wireless Ad-hoc Network에서 보안 협력 캐싱 기법에 관한 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.91-98
    • /
    • 2013
  • Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

A GTS-based Sensor Data Gathering under a Powerful Beam Structure (파워 빔 구조에서 GTS 기반 센서 데이터 수집 방안)

  • Lee, Kil Hung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.1
    • /
    • pp.39-45
    • /
    • 2014
  • This paper proposes an architecture of a sensor network for gathering data under a powerful beam cluster tree architecture. This architecture is used when there is a need to gather data from sensor node where there is no sink node connected to an existing network, or it is required to get a series of data specific to an event or time. The transmit distance of the beam signal is longer than that of the usual sensor node. The nodes of the network make a tree network when receiving a beam message transmitting from the powerful root node. All sensor nodes in a sink tree network synchronize to the superframe and know exactly the sequence value of the current superframe. When there is data to send to the sink node, the sensor node sends data at the corresponding allocated channel. Data sending schemes under the guaranteed time slot are tested and the delay and jitter performance is explained.

A Study for Detection Accuracy Improvement of Malicious Nodes on MANET (MANET에서의 의심노드 탐지 정확도 향상을 위한 기법 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.4
    • /
    • pp.95-101
    • /
    • 2013
  • MANET has an advantage that can build a network quickly and easily in difficult environment to build network. In particular, routing protocol that uses in existing mobile environment cannot be applied literally because it consists of only mobile node. Thus, routing protocol considering this characteristic is necessary. Malicious nodes do extensive damage to the whole network because each mobile node has to act as a router. In this paper, we propose technique that can detect accurately the suspected node which causes severely damage to the performance of the network. The proposed technique divides the whole network to zone of constant size and is performed simultaneously detection technique based zone and detection technique by collaboration between nodes. Detection based zone translates the information when member node finishes packet reception or transmission to master node managing zone and detects using this. The collaborative detection technique uses the information of zone table managing in master node which manages each zone. The proposed technique can reduce errors by performing detection which is a reflection of whole traffic of network.

A management scheme of agent node in crowd group (군집 그룹에서 에이전트 노드 관리 방안)

  • Park, Sangjoon;Lee, Jongchan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.537-538
    • /
    • 2021
  • In this paper, we consider the agent management scheme for the data gathering in the crowd group. To the critical data gathered in dangerous region, the possibility of mission failure caused by the sensor node damage can be high. Hence, we study the node processing to the danger agent node through the cooperative network method for the sensor nodes.

  • PDF

Study of Location-based Routing Techniques of BS and Sensor Node (BS와 센서 노드의 위치 기반 라우팅 기법에 관한 연구)

  • Kim, Yong-Tae;Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.289-295
    • /
    • 2012
  • Routing technique of wireless sensor network that is presented to improve effectiveness of consumption in energy at the previous study is existing in various ways, however for routing, its own location data and nodes' location data close to with 1-hop distance should be kept. And it uses multi-hop transmission method that transmits data to BS node via several nodes. This technique makes electronic consumption of sensor node and entire network's energy consumption so that it makes effective energy management problem. Therefore, this paper suggests location based 1-hop routing technique of BS node that satisfies distance $d{\pm}{\alpha}$ with source node using RSSI and radio wave range of sensor node.

Energy-efficient routing protocol based on Localization Identification and RSSI value in sensor network (센서 네트워크에서 RSSI 값과 위치 추정 기반의 에너지 효율적인 라우팅 프로토콜)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Gil-Cheol
    • Journal of Digital Convergence
    • /
    • v.12 no.1
    • /
    • pp.339-345
    • /
    • 2014
  • This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.

A Study on Region-based Secure Multicast in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 영역기반 보안 멀티캐스트 기법 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.3
    • /
    • pp.75-85
    • /
    • 2016
  • MANET is a network composed only mobile network having limited resources and has dynamic topology characteristics. Therefore, every mobile node acts as a route and delivers data by using multi-hop method. In particular, group communication such as multicast is desperately needed because of characteristics such as battery life of limited wireless bandwidth and mobile nodes. However, the multicast technique can have different efficient of data transmission according to configuring method of a virtual topology by the movement of the nodes and the performance of a multicast can be significantly degraded. In this paper, the region based security multicast technique is proposed in order to increase the efficiency of data transmission by maintaining an optimal path and enhance the security features in data transmission. The group management node that manages the state information of the member nodes after the whole network is separated to area for efficient management of multicast member nodes is used. Member node encrypts using member key for secure data transmission and the security features are strengthened by sending the data after encrypted using group key in group management node. The superiority of the proposed technique in this paper was confirmed through experiments.