• 제목/요약/키워드: multiple token

검색결과 36건 처리시간 0.03초

토큰버스 프로토콜의 우선순위기능에서 대시시간의 분산 (Variance of waiting time in the priority scheme of token bus protocols)

  • Hong, Seung-Ho
    • 전자공학회논문지A
    • /
    • 제32A권5호
    • /
    • pp.42-53
    • /
    • 1995
  • Token bus protocols have been sidely accepted for Medium Access Control (MAC) in real-time networks such as those used in factory automation, distributed process control, nuclear power plant, aircraft and spacecraft. Token bus protocols provide timer-controlled priority mechanism, which offers multiple level of privilege of medium access to different type of traffic. This paper presents and approximate analytical model for the evaluation of variance of waiting time in the time-controlled proiority scheme of token bus protocols. Token bus system is assumed to be operated with singe-service discipline which is the practical case of real-time networks such as those used in distributed process control and factory automations. The approximate analytical model is validated by comparison with the simulation resuls.

  • PDF

Multiple token-based neighbor discovery for directional sensor networks

  • Nagaraju, Shamanth;Gudino, Lucy J.;Sood, Nipun;Chandran, Jasmine G.;Sreejith, V.
    • ETRI Journal
    • /
    • 제42권3호
    • /
    • pp.351-365
    • /
    • 2020
  • Directional sensor networks (DSNs) can significantly improve the performance of a network by employing energy efficient communication protocols. Neighbor discovery is a vital part of medium access control (MAC) and routing protocol, which influences the establishment of communication between neighboring nodes. Neighbor discovery is a challenging task in DSNs due to the limited coverage provided by directional antennas. Furthermore, in these networks, communication can only take place when the beams of the directional antennas are pointed toward each other. In this article, we propose a novel multiple token-based neighbor discovery (MuND) protocol, in which multiple tokens are transmitted based on an area exploration algorithm. The performance of the protocol is evaluated using the Cooja simulator. The simulation results reveal that the proposed MuND protocol achieves lower neighbor discovery latency, with a 100% neighbor discovery ratio, and has a relatively low communication overhead and low energy consumption.

ID 도난 시나리오에 강인한 불변 홍채 키 생성 방법 (Invariant Iris Key Generation Method Robust To Stolen Token Scenario)

  • 이연주;김재희
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.959-960
    • /
    • 2008
  • Recently, biometric authentication mechanism has been used to provide high level of security in cryptographic systems. In this paper, we propose an efficient method of generating invariant iris key to be applied in cryptographic systems. In order to generate iris key and improve the performance at the stolen token scenario, multiple random projection technique was combined with multiple linear transformation methods. From the experimental results, we proved that invariant iris keys were generated and the proposed method was robust to stolen token scenario.

  • PDF

Token's function and role for securing ecosystem

  • Yoo, Soonduck
    • International Journal of Advanced Culture Technology
    • /
    • 제8권1호
    • /
    • pp.128-134
    • /
    • 2020
  • The purpose of this study is to investigate the role and function of tokens to form a healthy blockchain-based ecosystem. Tokens must be constructed in a way that enhances their desired behavior to grow into a healthy token economy. The actions required of ecosystem participants in designing tokens should enable each individual to receive appropriate incentives (rewards) and encourage voluntary participation in taking this action. Also, all ecosystem participants must design to make the token ecosystem self-sustainable by generating profits. For example, in Bitcoin's proof-of-work method, mining is designed as a desirable behavior. Token-based services should be designed to induce multiple engagements, to design penalties for undesirable behavior, and to take into account evolutionary development potentials. Besides, the economic value of the entire token ecosystem will increase if the value that is designed and designed to take into account the revolutionary Innovation Possibility is greater than the reward amount paid to tokens. This study will contribute to presenting relevant service model by presenting how to design tokens and criteria when establishing blockchain-based service model. Future research is needed to discover new facts through a detailed comparative analysis between Tokennomics models.

IEEE 802.11 네트워크에서 TCP 업링크 스테이션 간 공평성 지원 (TCP Uplink Station-Level Fairness Support in IEEE 802.11 Networks)

  • 전경구
    • 한국통신학회논문지
    • /
    • 제34권6B호
    • /
    • pp.553-558
    • /
    • 2009
  • IEEE 802.11 네트워크에서 업링크와 다운링크 간 TCP 공평성 보장을 위한 여러 연구가 진행되어 왔다. 하지만 제안된 방법들은 하나의 스테이션이 여러 개의 TCP 업링크 스트림들을 동시에 사용하여 업링크 대역폭을 독점하는 불공평성 문제에는 효과적이지 못하다. 이러한 문제에 대해 본 논문에서는 AP가 각 업링크 스테이션마다 token bucket을 지정하여 전송 대역폭 독점을 막는 방을 제안한다. 이 방법은 업링크와 다운링크 간의 공평성도 보장할 수 있다. 제안 방법은 token bucket을 사용할 때 나타날 수 있는 전승 대역폭의 utilization 저하를 막기 위해 스테이션 간에 잉여 token을 이동할 수 있도록 한다. 이러한 token 이동을 통해 공평성과 utilization간의 균형을 맞출 수 있다. 시뮬레이션을 통해 제안 방식이 업링크 스테이션간의 내역폭 사용의 공평성은 물론, 업링크와 다운링크간의 공평성도 보장함을 확인할 수 있었다.

Development of a Real-time Communication Service over Random Medium Access Scheme Networks

  • Choo, Young-Yeol;Kwon, Jang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.350-353
    • /
    • 2004
  • The increasing use of Ethernet-TCP/IP network in industry has led to the growing interest in its reliability in real-time applications such as automated manufacturing systems and process control systems. However, stochastic behavior of its medium access scheme makes it inadequate for time-critical applications. In order to guarantee hard real-time communication service in Ethernet-TCP/IP network, we proposed an algorithm running over TCP/IP protocol stack without modification of protocols. In this paper, we consider communication services guaranteeing deadlines of periodic real-time messages over MAC protocols that have unbounded medium access time. We propose a centralized token scheduling scheme for multiple access networks. The token is used to allow a station to transmit its message during the time amount that is appended to the token. The real-time performance of the proposed algorithm has been described.

  • PDF

대용량 공유 스토리지 시스템을 위한 토큰 버킷기반 성능 제어 기법 (Token-Bucket-based Performance Control Techniques for Large-Scale Shared Storage Systems)

  • 남영진;박찬익
    • 정보처리학회논문지A
    • /
    • 제12A권7호
    • /
    • pp.605-612
    • /
    • 2005
  • 스토리지 시스템의 성능과 용량이 증가됨에 따라서, 스토리지 시스템은 이제 다양한 사용자에 의해서 공유되어 사용되는 것이 일반화 되고있는 추세이다. 본 논문은 네트워크에서 널리 이용되는 토큰 버킷을 이용하여 공유 스토리지 시스템 상에서 각 사용자 원하는 스토리지 입출력성능을 확률적으로 보장하는 기법을 설계한다. 또한, 다양한 형태의 작업부하를 이용한 시뮬레이션을 통해서 제안된 알고리즘의 동작 및 성능을 검증한다.

토큰 버스 네트워크의 동적 타이머 제어방식 및 성능해석에 관한 연구 (Dynamic timer-controlled algorithm and its performance analysis on the token bus network)

  • 정범진;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.55-60
    • /
    • 1992
  • The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

  • PDF

Communications Protocol Used in the Wireless Token Rings for Bird-to-Bird

  • Nakajima, Isao;Juzoji, Hiroshi;Ozaki, Kiyoaki;Nakamura, Noboru
    • Journal of Multimedia Information System
    • /
    • 제5권3호
    • /
    • pp.163-170
    • /
    • 2018
  • We developed a multicast communication packet radio protocol using a time-sharing tablet system ("wireless token ring") to achieve the efficient exchange of files among packet radio terminals attached to swans. This paper provides an overview of the system and the protocol of the packet communications. The packet device forming the main part of the transceiver developed is the Texas Instruments CC2500. This device consists of one call-up channel and one data transmission channel and could improve error frame correction using FEC (forward error correction) with 34.8 kbps MSK and receiving power of at least -64 dBm (output 1 dBm at distance of 200 m using 3 dBi antenna). A time-sharing framework was determined for the wireless token ring using call sign ordinals to prevent transmission right loss. Tests using eight stations showed that resend requests with the ARQ (automatic repeat request) system are more frequent for a receiving power supply of -62 dBm or less. A wireless token ring system with fixed transmission times is more effective. This communication protocol is useful in cases in which frequency resources are limited; the energy consumed is not dependent on the transmission environment (preset transmission times); multiple terminals are concentrated in a small area; and information (position data and vital data) is shared among terminals under circumstances in which direct communication between a terminal and the center is not possible. The method allows epidemiological predictions of avian influenza infection routes based on vital data and relationships among individual birds based on the network topology recorded by individual terminals. This communication protocol is also expected to have applications in the formation of multiple in vivo micromachines or terminals that are inserted into living organisms.

k-평균 알고리즘을 활용한 음성의 대표 감정 스타일 결정 방법 (Determination of representative emotional style of speech based on k-means algorithm)

  • 오상신;엄세연;장인선;안충현;강홍구
    • 한국음향학회지
    • /
    • 제38권5호
    • /
    • pp.614-620
    • /
    • 2019
  • 본 논문은 전역 스타일 토큰(Global Style Token, GST)을 사용하는 종단 간(end-to-end) 감정 음성 합성 시스템의 성능을 높이기 위해 각 감정의 스타일 벡터를 효과적으로 결정하는 방법을 제안한다. 기존 방법은 각 감정을 표현하기 위해 한 개의 대푯값만을 사용하므로 감정 표현의 풍부함 측면에서 크게 제한된다. 이를 해결하기 위해 본 논문에서는 k-평균 알고리즘을 사용하여 다수의 대표 스타일을 추출하는 방법을 제안한다. 청취 평가를 통해 제안 방법을 이용해 추출한 각 감정의 대표 스타일이 기존 방법에 비해 감정 표현 정도가 뛰어나며, 감정 간의 차이를 명확히 구별할 수 있음을 보였다.