• Title/Summary/Keyword: Message Delay

Search Result 372, Processing Time 0.028 seconds

Network Synchronization for Collaborative Work in Distributed Environment (분산 환경에서의 협업을 위한 네트워크 동기화 기법)

  • Song, Jung-Wook;Kwon, Yong-Moo
    • Journal of Information Technology Services
    • /
    • v.10 no.3
    • /
    • pp.203-212
    • /
    • 2011
  • In the every day life of the people, the Internet is widely used. Currently over 1.9 billion people have one or more email addresses and over 600 million people use the Facebook. People are collaborating via the Internet more and more. When people are collaborating through the Internet, the differences of the message delivery delay are the biggest problem that disturbs the collaborative work over the network. To solve the differences of the message delivery delay, we introduce the delay-gap method. An experimental code have been implemented and the efficiency of the delay-gap is presented through the results from the experiment that have many participants.

An Efficient Routing Algorithm Based on the Largest Common Neighbor and Direction Information for DTMNs (DTMNs를 위한 방향성 정보와 최대 공동 이웃 노드에 기반한 효율적인 라우팅 프로토콜)

  • Seo, Doo Ok;Lee, Dong Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.83-90
    • /
    • 2010
  • DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

Relay node selection scheme based on message distribution for DTN (DTN에서 메시지 분포에 따른 중계 노드 선택 기법)

  • Dho, Yoon-hyung;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.431-433
    • /
    • 2016
  • In this paper, we propose an algorithm that analyzes characteristic nodes to select efficient relay nodes using message distribution. Existing delay-tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

  • PDF

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

Designing of Dynamic Sensor Networks based on Meter-range Swarming Flight Type Air Nodes

  • Kang, Chul-Gyu;Kim, Dae-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.625-628
    • /
    • 2011
  • Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

Performance Analysis of a Network System using the CAN Protocol (CAN 프로토콜을 이용한 네트워크 시스템의 성능 분석)

  • Kim, Dae-Won;Choi, Hwan-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.5
    • /
    • pp.218-225
    • /
    • 2001
  • This paper analyses the performance of network system using the CAN(Controller Area Network) protocol. Given messages are assumed to be scheduled by the DMS(Deadline Monotonic Scheduling) algorithm. The mathematical models for time-delay that can be occurred between CAN nodes are defined. The effectiveness of modeling is shown by comparing the difference of time-delay between simulations and practical experiments. We analyse the results according to the variation of factors, such as the number of nodes, the transmission speed, the message size and the number of aperiodic messages through simulation and confirm the real-time performance of lower priority messages. We also investigate the real-time performance of periodic messages when aperiodic message generates.

  • PDF

Determination of Importance of Software Blocks for Improving Quality of Service in Switching System (교환시스템의 서비스 품절수준 향상을 위한 소프트웨어 블록의 중요도 결정)

  • 조재균
    • The Journal of Information Systems
    • /
    • v.8 no.1
    • /
    • pp.93-108
    • /
    • 1999
  • The switching system is designed and developed to satisfy the performance design objectives recommended by ITU for call processing capacity and quality of service(QOS), etc. When the results by actual measurement at the system testing phase do not satisfy the performance design objectives, however, an effort is required to improve the performance. This paper presents a method for improving QOS by modifying the application programs for the switching system. In the proposed method, the sequence chart related to a delay time for call connection is modelled using PERT(Program Evaluation and Review Technique) network. Then, the criticality index of a message is calculated using Monte Carlo simulation to evaluate which message's processing time to decrease in order to decrease the delay time and thus to improve QOS. The criticality index of a block is also calculated to identify those software blocks that significantly contribute to the delay time.

  • PDF

Effective Emergency-Warning Message Transmission in the Vehicle-to-Vehicle Communication Environment (차량 간 통신 환경에서 효과적인 위험 경고 메시지 전송 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1B
    • /
    • pp.1-8
    • /
    • 2012
  • In this paper, we propose an algorithm to improve collision avoidance in Vehicle-to-Vehicle (V2V) networks based on IEEE 802.11p. Since IEEE 802.11p adopts CSMA/CA as a multiple access scheme and an emergency warning message (EWM) is delivered to behind vehicles in a multi-hop manner, due to transmission collision, the more vehicles in the vehicle chain results in a longer delay. The longer delay increases the possibility of a rear-end collision. In order to ensure message reception with low latency, we consider implicit acknowledgement of a broadcasted EWM message and propose an algorithm to reduce redundant message transactions, called Two-Way Implicit Acknowledgement (TWIA). By simulations, we show that our proposed algorithm can reduce the latency until the last car receives the message by 9% and the success rate every car receives the message within 0.7sec by 12% at 100 fixed-number-of-car environment.

Performance Analysis on Delay- and Disruption-Tolerant Network in Interplanetary Network (행성 간 통신에서의 지연/분열 허용 네트워크 성능 분석)

  • Baek, Jaeuk;Han, Sang Ik;Kim, In-kyu
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.42-49
    • /
    • 2017
  • Delay- and Disruption-Tolerant Network (DTN) has been considered as a key technology to overcome main challenges in interplanetary communications such as an intermittent connectivity and high bit error rates. The lack of end-to-end connectivity between source and destination results in long and variable delays and data loss, hence the Internet Protocols cannot operate properly in such environments because it requires an end-to-end connectivity. The DTN, which utilizes 'store-and-forward' message passing scheme between nodes, can overcome the lack of end-to-end connectivity in Interplanetary Network (IPN). In this paper, DTN is applied to 3-hop relay IPN, where messages are transmitted from Earth ground station to Lunar lander through Earth satellite and Lunar orbiter. ONE simulator is used to reflect the real environment of IPN and an efficient resource management method are analyzed to guarantee the message delivery by optimizing a message TTL (Time to Live), buffer size and message fragmentation.