• Title/Summary/Keyword: efficient path

Search Result 1,283, Processing Time 0.032 seconds

An Efficient Scheme for Electing Cluster Header Using Remaining Electric Energy in Ad Hoc Networks (Ad Hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤더 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.6
    • /
    • pp.1173-1178
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header.

XPERT : An XML Query Processing System using Relational Databases (관계형 DBMS를 이용한 XML 질의 처리 시스템 XPERT의 개발)

  • Jung Min-Kyoung;Hong Dong-Kweon
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.1-10
    • /
    • 2006
  • This paper introduces the development XPERT(XML Query Processing Engine using Relational Technologies) which is based on relational model. In our system we have used a decomposed approach to store XML files in relational tables. XML queries are translated to SQLs according to the table schema, and then they are sent to the relational DBMS to get the results back. Our translation scheme produces AST(Abstract Syntax Tree) by analyzing XQuery expressions at first. And on traversing AST proper SQLs are generated. Translated SQLs can reduce the number of joins by using path information and utilize dewey number to preserve document originated orderings among compoments in XML. In addition we propose the efficient algorithms of XPath and XQuery translation. And finally we show the implementation of our prototype system for the functional evaluations.

Security Policy Negotiation Model Design for Secure Network Management (안전한 망 관리를 위한 보안정책 협상모델 설계)

  • Park, Jin-Ho;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.171-176
    • /
    • 2004
  • This paper presents the design of a certain highly efficient security policy negotiation of SPS(Security Policy System) for secure network management using mobile agent system. The conventional IP security systems for secure network management have some problems. A drawback to these systems is that the required policy between each security area is different. Another problem is not possible to guarantee whether a packet is transmitted through the same path by both directions and is protected by the same policy due to the topology of the network. Unlike conventional systems, the model developed herein can be resolved by using a mobile agent technology. If each domain needs a negotiation of security policy, a mobile agent manages the result of the negotiation in the form of a passport and guarantees the authentication and reliability each other by using the passport.

An Proxy Trajectory Based Storage in Sensor Networks (센서네트워크에서의 프록시 트라젝토리 기반 데이터 저장 기법)

  • Lim, Hwa-Jung;Lee, Heon-Guil
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.513-522
    • /
    • 2008
  • Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

An Efficient Resource Discovery Mechanism based on Distributed Location Information in Pure P2P Environments (순수 P2P 환경에서 분산된 위치 정보를 이용한 자원 검색 기법)

  • Kim In-suk;Kang Yong-hyeog;Eom Young Ik
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.573-581
    • /
    • 2004
  • Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks (다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅)

  • Sohn, Hee-Seok;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.2
    • /
    • pp.53-65
    • /
    • 2016
  • Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

A Three-step Method of Immunotoxicity Assessment

  • Lee, Jeong-Woon;Shin, Ki-Duk;Kim, Kap-Ho;Kim, Eun-Joo;Han, Sang-Seop;Jeong, Tae-Cheon;Koh, Woo-Suk
    • Toxicological Research
    • /
    • v.16 no.4
    • /
    • pp.317-323
    • /
    • 2000
  • The immunosuppressive effects of thirty nine chemicals chosen by their potential toxicity were evaluated using a three-step testing method. The immunotoxicity test method developed in this study consisted of three simple assays of lymphoproliferation, mixed leukocyte response, and interleukin (IL)-2 production. The first step was mitogen-induced proliferation assay. Ten chemicals showed the inhibitory effects on the mitogen (lipopolysaccharide or concanavalin A)-induced proliferation in dose-dependent manners. The second step was mixed lymphocyte response. This step crosschecked the growth-suppressive effects detected at the first step. All of 10 chemicals, which showed suppression of lymphoproliferation, also exhibited the suppressive effects on the mixed lymphocyte response in the similar range of chemical concentration. The third step was planned to determine whether or not this growth suppression was mediated through an early activation of T-cell, which could be represented with IL-2 production. Six out of 10 chemicals decreased the interleukin-2 production in the similar concentration range used in the step 1 and 2. These results suggest that those 6 chemicals might have their targets on the signal transduction path-way toward the IL-2 production. In the meantime the other 4 chemicals might have their targets after the IL-2 production signal. Taken all together, the three-step test would be simple, fast, and efficient to deter-mine whether or not the chemical has immunosuppressive effects.

  • PDF

A Design for Instructional Models to Use Calculators in Elementary School Mathematics (계산기를 활용한 초등학교 수학과 교수-학습 모형 개발)

  • Ahn Byung-gon;Kim Young-tae;Rim Hae-Kyung;Rew Keun-bong
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.4 no.1
    • /
    • pp.1-19
    • /
    • 2000
  • This paper aims to enhance students' interest in the use of calculators in mathematics education and promote their use of calculators in real-life situations. Towards these ends, problem types and instructional models developed for the efficient utilization of calculators. The instructional models focus on teaching mathematics relying on the path through which expert teachers have gone through to gain relevant knowledge. By developing problem types and instructional models suitable for calculator use, We can contribute to a better attainment of instructional goals in mathematics education. The instructional models and problem types will aid teachers in making decisions about instructional development plan and basic features of instructional activities. The use of a new medium will also lead to increased interest and confidence in learning, thus contributing to the enhancement of students' ego.

  • PDF

The Stories of Pre-service Childcare Teachers' Practicum Experiences : Focusing on pre-service Childcare Teacher Training Centers (예비보육교사들의 실습경험에 대한 이야기 -보육교사교육원을 중심으로-)

  • Lim, Kyung-Ok
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.2
    • /
    • pp.750-761
    • /
    • 2016
  • This study attempted to analyze the practicum experiences of pre-service childcare teachers (level 3) and their meaning and set a direction for efficient childcare practicum for the level 3 childcare teachers. For this, 16 trainees from 'P' Pre-service Childcare Teacher Training Center and 'S' Pre-service Childcare Teacher Training Center in Gyeonggi-do were investigated, and there was an interview with them for qualitative analysis. The study results found the followings: This study is showed that child care and teaching practice is the difficulty of training institutions selected, lack of preparation exercise, disagreement between training courses and related field, the stress of exercise, difficulties in infants teaching and experience the reality in the field. In terms of the meaning of childcare practicum, it helped the pre-service childcare teachers set their career path and establish values. In addition, it was helpful in building practical knowledge. In addition, there was a discussion on how to operate the childcare practicum in a well-organized and systematic manner, focusing on the derived topics.

Effective Keyword Search on Semantic RDF Data (시맨틱 RDF 데이터에 대한 효과적인 키워드 검색)

  • Park, Chang-Sup
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.11
    • /
    • pp.209-220
    • /
    • 2017
  • As a semantic data is widely used in various applications such as Knowledge Bases and Semantic Web, needs for effective search over a large amount of RDF data have been increasing. Previous keyword search methods based on distinct root semantics only retrieve a set of answer trees having different root nodes. Thus, they often find answer trees with similar meanings or low query relevance together while those with the same root node cannot be retrieved together even if they have different meanings and high query relevance. We propose a new method to find diverse and relevant answers to the query by permitting duplication of root nodes among them. We present an efficient query processing algorithm using path indexes to find top-k answers given a maximum amount of root duplication a set of answer trees can have. We show by experiments using a real dataset that the proposed approach can produce effective answer trees which are less redundant in their content nodes and more relevant to the query than the previous method.