• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1656-1660
• /
• 2006

Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.717-720
• /
• 2000

Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.7
• /
• pp.1-5
• /
• 1998

In this paper, recovery method with high-bitrate and low-bitrate coder was implemented in order to recover consecutive packet loss over the Internet. LPC was used as redundant audio data for recover of lost packets and RTP parcket format was modified for accommodation of redundant data. In measuring results using random packet loss rate with three redundant datra in every packet, it has shown that recovery rate was 80% in los rate of 50%. Since the processing delay for recovery of the lost packet was 200ms, this recovery method can be applied to real-time Internet sevice such as Internet phone.

• Ocean and Polar Research
• /
• v.28 no.4
• /
• pp.459-465
• /
• 2006

Ambient noise as a background noise in the ocean has been well known for its the various and irregular signal characteristics. Generally, these signals we treated as noise and they are analyzed through stochastical level if they don't include definite sinusoidal signals. This study is to see how ocean ambient noise can be analyzed by the chaotic analysis technique. The chaotic analysis is carried out with underwater ambient noise obtained in areas near the Korean Peninsula. The calculated physical parameters of time series signal are as follows: histogram, self-correlation coefficient, delay time, frequency spectrum, sonogram, return map, embedding dimension, correlation dimension, Lyapunov exponent, etc. We investigate the chaotic pattern of noises from these parameters. From the embedding dimensions of underwater noises, the assesment of underwater noise by chaotic analysis shows similar results if they don't include a definite sinusoidal signal. However, the values of Lyapunov exponent (divergence exponent) are smaller than that of random noise signal. As a result we confirm the possibility of classification of underwater noise using Lyapunov analysis.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.288-298
• /
• 2003

We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.

• Journal of Convergence for Information Technology
• /
• v.10 no.6
• /
• pp.1-7
• /
• 2020

The demand on the underwater communications is extremely increasing in searching for underwater resources, marine expedition, or environmental researches, yet there are many problems with the wireless communications because of the characteristics of the underwater environments. Especially, with the underwater wireless networks, there happen inevitable delay time and spacial inequality due to the distances between the nodes. To solve these problems, this paper suggests a new solution based on ALOHA-Q. The suggested method use random NAV value. and Environments take reward through communications success or fail. After then, The environments setting NAV value from reward. This model minimizes usage of energy and computing resources under the underwater wireless networks, and learns and setting NAV values through intense learning. The results of the simulations show that NAV values can be environmentally adopted and select best value to the circumstances, so the problems which are unnecessary delay times and spacial inequality can be solved. Result of simulations, NAV time decreasing 17.5% compared with original NAV.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.365-377
• /
• 2006

We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

• Journal of the Korean Magnetics Society
• /
• v.13 no.5
• /
• pp.216-220
• /
• 2003

In this work, transmission characteristics of read and write signal were calculated when a MRAM (magnetic random access memory) cell is operated up to 10 GHz. Test device having long read and write lines was modeled in 3 dimensions to perform a simulation. The simulation was divided into two parts, read and write operations, and S-parameters were computed utilizing FEM (finite element method) algorithm. Transmission coefficients, S$\sub$21/, for read and write operations of MRAM device which was designed for a single cell test configuration were analyzed from DC to 1 GHz and DC to 10 GHz, respectively. When the insulator thickness between the bit and sense lines was increased from 500 to 1500 ${\AA}$, 3 dB attenuation frequency was increased by 3.3 times, from 135 to 430 MHz. The length of the bit and sense lines were 600 ${\mu}$m. In addition, access time was estimated by calculating the propagation delay utilizing S-parameters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.