• Title/Summary/Keyword: multiple token

Search Result 36, Processing Time 0.035 seconds

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

  • Hong, Seung-Ho
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.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
    • /
    • v.42 no.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.

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

  • Lee, Youn-Joo;Kim, Jai-Hie
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • 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
    • /
    • v.8 no.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.

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

  • Jun, Kyoog-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.553-558
    • /
    • 2009
  • There have been various research efforts to support the fairness between uplink and downlink of TCP streams in IEEE 802.11 networks. Existing methods, which have been effective for the fairness, however could not provide the solution for the unfairness caused by the situation in which a station which is having multiple TCP uplink streams monopolizes the uplink bandwidth. This paper proposes a method that AP allocates token buckets for each uplink TCP station. The proposed method is also able to support the fairness between the uplink and downlink. To remedy the underutilization which may happen under token bucket-based schemes, it allows the movement of redundant tokens among the token buckets. By controlling the token movements, it can balance the fairness and the utilization. Simulation results show that the proposed method is able to support the fairness of the TCP uplink stations, as well as the fairness between the uplink and downlink.

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

  • Choo, Young-Yeol;Kwon, Jang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • 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 (대용량 공유 스토리지 시스템을 위한 토큰 버킷기반 성능 제어 기법)

  • Nam Young-Jin;Park Chan-Ik
    • The KIPS Transactions:PartA
    • /
    • v.12A no.7 s.97
    • /
    • pp.605-612
    • /
    • 2005
  • With the increase in I/O performance and capacity, it becomes commonplace that storage systems are shared by multiple storage users. This paper proposes an efficient token-bucket-based performance control technique for the shared storage that can statistically guarantee demanded storage performance from different users. It also verifies the operational characteristics and performance of the proposed scheme under various types of I/O workloads.

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

  • 정범진;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • 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
    • /
    • v.5 no.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.

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

  • Oh, Sangshin;Um, Se-Yun;Jang, Inseon;Ahn, Chung Hyun;Kang, Hong-Goo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.5
    • /
    • pp.614-620
    • /
    • 2019
  • In this paper, we propose a method to effectively determine the representative style embedding of each emotion class to improve the global style token-based end-to-end speech synthesis system. The emotion expressiveness of conventional approach was limited because it utilized only one style representative per each emotion. We overcome the problem by extracting multiple number of representatives per each emotion using a k-means clustering algorithm. Through the results of listening tests, it is proved that the proposed method clearly express each emotion while distinguishing one emotion from others.