• Title/Summary/Keyword: Time delay protocol

Search Result 539, Processing Time 0.035 seconds

Timer Selection for Satisfying the Maximum Allowable Delay using Performance Model of Profibus Token Passing Protocol (Profibus 성능 모델에서 최대 허용 전송 지연을 만족할 수 있는 타이머 선정에 관한 연구)

  • Kim, Hyun-Hee;Lee, Kyung-Chang;Lee, Seok
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.181-184
    • /
    • 2003
  • Recently, the fieldbus becomes an indispensable component for many automated systems. In the fieldbus system, realtime data containing sensor values and control commands has a tendency to rapidly lose its value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as target rotation timer of token passing protocol, it is necessary to select proper parameter settings to satisfy the real-time requirement for communication delay. This paper presents the timer selection method for Profibus token passing networks using genetic algorithm (GA) to meet the delay requirements.

  • PDF

Evaluation of Proposed CSMA/CA Protocol in The Underwater Acoustic Networks (수중 네트워크에서 제안된 CSMA/CA 프로토콜의 평가)

  • Kim, Lack-Hoon;Shim, Tae-Bo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.1
    • /
    • pp.63-70
    • /
    • 2009
  • The purpose of this paper is to propose a CSMA/CA protocol to reduce the delay time and increase the throughput of the original CSMA/CA protocol. In underwater environments, the efficiency of the protocol is reduced due to the increase of the propagation delay time, which results in increase of the collision possibility causing lowering of the transmission efficiency Considering this propagation delay, this paper propose to insert the STANDBY frame in a CTS packet in order to avoid the TimeOut status of the CSMA/CA protocol. According to the simulated test results, proposed protocol is increased about 20% throughput than original CSMA/CA protocol. And the more value of propagation per transmission delay 'a' is low, the more throughput of protocol is better.

Communication Delay Properties in Performance Model of Profibus Token Passing Protocol (Profibus 토큰 패싱 프로토콜 성능 모델에서의 전송 지연 특성)

  • Lee, Kyung-Chang;Kim, Hyun-Hee;Lee, Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.12
    • /
    • pp.1055-1064
    • /
    • 2003
  • In many automated systems, such as manufacturing systems and process plants, a fieldbus is a very important component for the exchange of various and sometimes crucial information. Some of the information has a tendency to rapidly lose its value as time elapses after its creation. Such information or data is called real-time data that includes sensor values and control commands. In order to deliver these data in time, the fieldbus network should be tailored to have short delay with respect to the individual time limit of various data. Fine-tuning the network for a given traffic requires the knowledge on the relationship between the protocol parameters such as timer values and the performance measure such as network delay. This paper presents a mathematical performance model to calculate communication delays of the Profibus-FMS network when the timer value and the traffic characteristics are given.

A Multichannel TDMA MAC Protocol to Reduce End-to-End Delay in Wireless Mesh Networks

  • Trung, Tran Minh;Mo, Jeong-Hoon
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.819-822
    • /
    • 2010
  • Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.

An Efficient Routing Algorithm for extreme networking environments (극단적인 네트워크 환경을 위한 효율적인 라우팅 알고리즘)

  • Wang, Jong Soo;Seo, Doo Ok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.47-53
    • /
    • 2012
  • Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.

A delay estimation-based synchronization protocol for multimedia services in ATM networks (ATM망에서 멀티미디어 서비스를 위한 지연 예측 기반 동기화 프로토콜)

  • 이동은;강인곤;김영선;김영천
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.5
    • /
    • pp.31-43
    • /
    • 1996
  • In this paper, we analyze the delay characteristics of the multimdedia traffic in B-ISDN, and propose a weighted variable-size window estimator considering the QoS characteristics of the media and the variable delay characteristics of the networks, and present a delay estimator-based synchronization protocol for the efficient synchronization in ATM-based B-ISDN. The proposed estimator assigns a high weight value to recent cells arrived in the receiver, and suitably adjusts window size in order to efficiently adapt to delay variation by the prameter to detect the delay variation of the networks. The proposed synchronization protocol estimates end-to-end delay by the weighted variable-size window estimator, and dynamically schedules th evirtual channel of the transmitter to playout multimedia data on time in the receiver. Also, we evaluate the performance of the delay estimator, which is the most importnat functional element in our proposed synchronization protocol, by the simulation and analyze the results of the simulation.

  • PDF

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

A Medium Access Control Protocol for rt- VBR Traffic in Wireless ATM Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

Development of communication delay model for Profibus token pssing Protocol (Profibus token pass ing protocol의 통신지연 모델 개발)

  • Kim, H. H.;Lee, K. C.;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.470-473
    • /
    • 2002
  • Most networks for automation are tuned to an expected traffic at their design stage. During their actual operations, however, the networks experience considerable changes in traffic from time to time. These traffic changes caused by common events like machine failure and production schedule change may adversely affect the network performance and, in turn, the performance of the connected devices. This paper presents communication delay model for Profibus token passing protocol, and introduces TTR selection methods to maintain a uniform level of network performance at all stations under changing network traffic.

  • PDF

A Delay Efficient and Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 지연과 버스티 트래픽에 적합한 MAC 프로토콜)

  • Kim, Hye Yun;Kim, Seong Cheol
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.254-260
    • /
    • 2017
  • Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.