• Title/Summary/Keyword: message rate

Search Result 330, Processing Time 0.027 seconds

Differential Multicast in Switch-Based Irregular Topology Network (스위치 기반의 비정규적 네트워크에서의 차별적인 다중 전송)

  • Roh, Byoun-Kwon;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.394-400
    • /
    • 2002
  • Networks of Workstations(NOWs), that has features of flexibility and scalability, recently has emerged as an inexpensive alternative to massively parallel multicomputers. However it is not easier to perform deadlock-free multicast than regular topologies like mash or hypercube. Single phase differential multicast(SPDM) is a modified multicast algorithm with less burden of the root node. By applying quality of serviece(QoS), a specific node can have differentiated service and artificial change of message flow pattern is also available. As the results of performance evaluation experiments, SPDM has lower latency and lower packet concentration rate of the root node than the case of SPAM, and has ability to control network load distribution among switch nodes by controlling the assignment rate among nodes.

Development of Oil Change Warning Algorithm and Display Device (오일교환경보 알고리즘 및 표시장치 개발)

  • Chun, Sang Myung
    • Tribology and Lubricants
    • /
    • v.30 no.3
    • /
    • pp.168-176
    • /
    • 2014
  • This paper presents an engine oil change warning algorithm based on the test results of a small dip-stick-gage-type engine-oil-deterioration-detection sensor, software to realize the algorithm and a display device to apply the software. The algorithm determines the engine oil deterioration condition from the rate of change in the dielectric constant based on the average measured capacitance at $80^{\circ}C$ after the engine stops. The rate of change in the dielectric constant at the time for oil change correlates with the time that one of recommended warning limits for engine oil physical properties such as TAN (Total Acid Number), TBN (Total Base Number) and viscosity is first reached. At this point, a warning signal for oil change appears on the display device like a smart-phone or individual display device. The frames of smartphone app have three stages. The user can directly input all of the thresholds into the frame of the smartphone app. The screen of the display device comprises one frame for each warning signature with the related message. The user can input the thresholds to the device through a USB cable connected to a personal computer.

A Technique to Exploit Cooperation for Packet Retransmission in Wireless Ad Hoc Networks

  • Kim, Hae-Soo;Buehrer, R. Michael
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.148-155
    • /
    • 2008
  • In wireless data communication systems, retransmission of an erroneous packet is inevitable due to the harsh communication environment. In this paper, an efficient retransmission scheme using cooperation from neighboring nodes is investigated. In the cooperative retransmission scheme, an erroneous packet is transmitted to the destination by cooperative nodes which have favorable channels. This cooperative retransmission scheme requires no a priori information of neighboring nodes and has no limitation on the number of cooperating nodes. Distributed beamforming is used to accommodate multiple cooperating nodes. Phase and frequency offsets of cooperating signals are extracted from the NACK message and used to co-phase retransmitted data packets. The outage probability of the cooperative retransmission scheme is analyzed for the case of perfect synchronization and when the offsets are estimated. To reduce the impact of the residual phase and frequency offsets in cooperating signals, a low-rate feedback scheme is also investigated. It is shown that improved outage probability and reduced packet error rate (PER) performance can be achieved even for long data packets. The proposed cooperative retransmission scheme is found to outperform simple retransmission by the source as well as decode-and-forward cooperation.

Performance Analysis of Air Interface for Network Access Security Services in IMT-2000 Mobile Systems (IMT-2000 이동통신시스템에서 망접속보안기능 적용에 따른 무선링크 성능 분석)

  • 권수근
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.6
    • /
    • pp.562-569
    • /
    • 2001
  • IMT-2000 mobile system will provide many application services such as mobile internet, wireless electronics commerce applications using air interface with high data rate. These applications require high data integrity, data confidentiality, user authentication, user identity confidentiality and non-repudiation. In this study, we analyze air interface performance for network access security services in IMT-2000 mobile systems. Signal traffic for network access security services requires 0.2kbps ∼ 4.5kbps with the conditions of 246∼768bits/message, 0.2 ∼ 1.0 basic service/sec and the security services of the rate of 0.2∼ 1.0 times compared with basic services.

  • PDF

Hybrid Hierarchical Architecture for Mobility Management in Mobile Content Centric Networking (이동 콘텐트 중심 네트워킹 구조에서의 하이브리드 계층적 이동성 관리 방안)

  • Lee, Ji-hoon
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1147-1151
    • /
    • 2018
  • As personal users create and share lots of contents at any time and any places, new networking architecture such as content centric networking (CCN) has emerged. CCN utilizes content name as a packet identifier, not address. However, current CCN has a limitation for content source mobility management. The movement of content sources cause long delivery latency and long service disruption. To solve that, a hierarchical mobility management was was proposed. However, the hierarchical mobility management scheme has still the loss of interest packets and long handoff latency. So, this paper presents the hybrid hierarchical mobility management in mobile CCN environements to reduce both the loss rate of interest packets and the handoff latency. It is shown from the performance evaluations shows that the proposed scheme provides low loss rate of control message.

Node Incentive Mechanism in Selfish Opportunistic Network

  • WANG, Hao-tian;Chen, Zhi-gang;WU, Jia;WANG, Lei-lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1481-1501
    • /
    • 2019
  • In opportunistic network, the behavior of a node is autonomous and has social attributes such as selfishness.If a node wants to forward information to another node, it is bound to be limited by the node's own resources such as cache, power, and energy.Therefore, in the process of communication, some nodes do not help to forward information of other nodes because of their selfish behavior. This will lead to the inability to complete cooperation, greatly reduce the success rate of message transmission, increase network delay, and affect the overall network performance. This article proposes a hybrid incentive mechanism (Mim) based on the Reputation mechanism and the Credit mechanism.The selfishness model, energy model (The energy in the article exists in the form of electricity) and transaction model constitute our Mim mechanism. The Mim classifies the selfishness of nodes and constantly pay attention to changes in node energy, and manage the wealth of both sides of the node by introducing the Central Money Management Center. By calculating the selfishness of the node, the currency trading model is used to differentiate pricing of the node's services. Simulation results show that by using the Mim, the information delivery rate in the network and the fairness of node transactions are improved. At the same time, it also greatly increases the average life of the network.

Self-Adaptive Checking Location Mechanism Based Georouting Algorithm in Mobile Ad Hoc Networks (이동 에드혹 네트워크에서 셀프 채킹 방법을 이용한 위치 기반 라우팅 알고리즘)

  • Youn, Joo-Sang;Park, Sangheon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1178-1181
    • /
    • 2009
  • Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

An Efficient Algorithm to Reduce the Broadcast Storm in VANETS

  • Aziz Hanifi;Robab Hamlbarani Haghi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.162-168
    • /
    • 2024
  • VANET (vehicular ad hoc network) refers to the case networks designed for vehicles. Such networks are established among the vehicles which are equipped with communication tools. Within these networks, vehicles are regarded as the network nodes. On time and on schedule transmission of data is of high significance for these networks. In order to accomplish the objective of on-time data transmission, specific electronic equipment is embedded in each vehicle which maintains ad hoc communications among the passengers. Information about traffic, road signs and on-line observation of traffic status can be transmitted via these networks; such data makes it possible for the driver to select the best route to reach his destination. If there are not any infrastructures, two broadcasting approaches can be considered: overflowing and rebroadcasting. The overflowing approach leads to heavy traffic. Hence, the challenge we face is to avoid the broadcasting flood. In this paper, an approach for the management of the broadcasting flood is proposed based on fuzzy theory. The proposed method is assumed to have better performance and efficiency than any other approaches in terms of crash rate, the rate of message success and delay

A Study on Improvement Direction of Public Service Advertisement to Prevent Drowsiness Driving on Highway (고속도로 졸음운전 방지를 위한 공익광고의 개선방향에 대한 연구)

  • Kwon, Jun-Ho
    • Journal of Digital Convergence
    • /
    • v.15 no.11
    • /
    • pp.77-83
    • /
    • 2017
  • The Korea Expressway Corporation announced that road casualties on expressways in 2016 were 262 deaths, a 24% decrease compared to 343 deaths in 2015, thanks to the expansion of rest areas for sleepy drivers. And the installation of large-sized banners containing strong messages such as "dozing while driving means your death" helped to reduce the casualty caused by driving while drowsy by 35% compared to that in 2015. Accordingly, this study tried to analyze the impact of public advertisements designed to prohibit dozing while driving on expressways upon drivers, and to present a direction for improvement of such public advertisements in the future. Based on case studies and library researches, the study contemplated the effects of public advertisements on expressways at home and abroad. It was confirmed that the accident rate has been higher on straight roads than on curved roads and that the framing of negative messages using provocative images or slogans on traffic accidents has been considerably effective. In conclusion, if the installation of outdoor billboards for public advertisements at rest areas for sleepy drivers is institutionalized and the systematic provision of information by road section inside and outside of vehicles via Variable Message Sign (VMS) services on expressways, outdoor billboards, or navigation services (including smartphones) is available, it would be possible to maximize the effect of the public advertisements.

A Study on the Scheduling Improvement for Periodic Real-time Taske on Middleware based on Linux(TMOSM/Linux) (리눅스 미들웨어(TMOSM/Linux)에서 주기성을 가진 실시간 태스크의 스케쥴링 향상에 관한 연구)

  • Park Ho-Joon;Lee Chang-Hoon
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.483-488
    • /
    • 2004
  • For real-time applications, the underlying operating system (0S) should support timeliness guarantees of real-time tasks. However, most of current operating systems do not provide timely management facilities in an efficient way. There could be two approaches to support timely management facilities for real-time applications: (1) by modifying 0S kernel and (2) by Providing a middleware without modifying 0S. In our approach, we adopted the middleware approach based on the TMO (Time-triggerred Message-triggered Object) model which is a well-known real-tine object model. The middleware, named TMSOM (TMO Support Middleware) has been implemented on various OSes such as Linux and Windows XP/NT/98. In this paper, we mainly consider TMOSM implemented on Linux(TMOS/Linux). Although the real-time schedul-ing aIgorithm used in current TMOSM/Linux can produce an efficient real-time schedule, it can be improved for periodic real-time tasks by considering several factors. In this paper, we discuss those factors and propose an improved real-time scheduling algorithm for periodic real-time tasks, In order to simulate the performance of our algorithm, we measure timeliness guarantee rate for periodic real-time tasks. The result shows that the performance of our algorithm is superior to that of existing algorithm. Additionally, the proposed algorithm can improve system performance by making the structure of real-time middleware simpler.