• ETRI Journal
• /
• 제17권1호
• /
• pp.23-36
• /
• 1995

We present a performance evaluation model of cell reassembly mechanism in an ATM switching system. An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications network. In such a system, there should be interface to convert inter-processor communication traffic from message format to cell format and vice versa, that is, mechanisms to perform the segmentation and reassembly sublayer. In this paper, we employ a continuous-time Markov chain for the performance evaluation model of cell reassembly mechanism with individual buffering, judicially defining the states of the mechanism. Performance measures such as message loss probability and average reassembly delay are obtained in closed forms. Some numerical illustrations are given for the performance analysis and dimensioning of the cell reassembly mechanism.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.466-468
• /
• 2005

MMORPG enables thousands of players to play in an evolving virtual world at the same time over the internet. So, the load of this kind of games is heavier than that of any other precedents. One of load balancing methods is map-partition to divide the load of entire system which is vulnerable to delay message between clients and servers. In this paper, we propose a game architecture using MigAgent to help migration of player character between field servers and to reduce message traffic between clients and field servers.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.246-248
• /
• 2005

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. However, CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO (Inha Semyung Humanoid RObot).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.231-234
• /
• 2003

In this paper, we propose the enhanced CSMA/CA MAC protocol fir mobile multi-hop wireless Ad-hoc networks. In the conventional wireless Ad-hoc network such as WLAN using CSMA/CA MAC protocol, communications between terminals that fn connected within multi-hop node may degrade the transmission efficiencies as increasing the multi-hop nodes because of RTS-CTS-DATA-ACK message exchange between terminals. In this raper, we apply the ACK/RTS control message into multi-hop transmission between terminals for wireless ad-hoc networks and improve the data traffic transmission efficiencies compared with conventional CSMA/CA MAC protocol used in WLAN.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2000년도 추계학술대회 논문집
• /
• pp.97-101
• /
• 2000

Energy consumption is considered as a principal ingredient in mobile wireless ad-hoc networks. In such a network, most of mobile nodes takes a role in forwarding messages received from neighbor nodes. Energy of these nodes is consumed in different rates depending on message traffic routes. This paper proposes a scheme to balance routing energy consumption by transferring routing function from node with small residual energy to node with enough residual energy. This scheme requires additional local message transfer, increasing the energy consumption of nodes to transfer routing function, and increasing total energy consumption of ad-hoc network. But balancing of energy consumption make the system lifetime the longer and increase the average node lifetime.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.990-994
• /
• 2000

The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discusses the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. This result serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

• 대한임베디드공학회논문지
• /
• 제12권1호
• /
• pp.63-69
• /
• 2017

This paper proposes a new device for a portable braille device using Atmega128 and solenoid magnets. This braille device is composed of three panels, and each panel has six solenoid dots. This device aims to help the disabled people who cannot communicate with others. As an application example, when a disabled people approach a traffic light, it sends a message via Bluetooth to the proposed device letting people recognize a dangerous area. The message converted from the database is based on standard braille chart.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.153-163
• /
• 2013

In recent years, more and more researches have been focusing on trust management of vehicle ad-hoc networks (VANETs) for improving the safety of vehicles. However, in these researches, little attention has been paid to the location privacy due to the natural conflict between trust and anonymity, which is the basic protection of privacy. Although traffic safety remains the most crucial issue in VANETs, location privacy can be just as important for drivers, and neither can be ignored. In this paper, we propose a beacon-based trust management system, called BTM, that aims to thwart internal attackers from sending false messages in privacy-enhanced VANETs. To evaluate the reliability and performance of the proposed system, we conducted a set of simulations under alteration attacks, bogus message attacks, and message suppression attacks. The simulation results show that the proposed system is highly resilient to adversarial attacks, whether it is under a fixed silent period or random silent period location privacy-enhancement scheme.

• 한국정보처리학회논문지
• /
• 제4권11호
• /
• pp.2732-2744
• /
• 1997

본 논문은 k-ary n-cubes에서 다중 전송에 기반을 두고 있으며, 결함허용과 채널 경쟁을 고려한 적응적 웜홀 라우팅 알고리즘을 제안한다. 제안된 알고리즘은 k-ary n-cube에서 차수 n에 대하여 (n-1)의 결함허용을 보장하기 위해 하나의 물리적 채널당 2n개의 가상채널을 사용한다. 이것은 결함허용을 고려한 기존의 적응적 라우팅 알고리즘보다 적은 수의 가상채널을 사용한다. 카오스 시뮬레이터를 이용하여 본 논문이 제안한 적응적 라우팅 알고리즘의 교통량과 결함허용을 고려한 메세지 지연도 함께 실험하였다．

• 대한임베디드공학회논문지
• /
• 제14권4호
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.