• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.604-611
• /
• 2017

In wireless sensor networks, an energy efficient operation is important since the energy of the sensors is limited. This paper proposes an energy efficient method that reduces a packet generation with Matrix Completion method where sensor value matrix has low-rank and decreases a collision rate and an overhead by transmitting only sensor ID to a time slot corresponding to the sensor value. Computer simulations demonstrates that the proposed method shows 17% of transmission failure and 73% of the packet generation compared to a conventional CSMA/CS. Delay time of transmitting information of the proposed method exhibits 22% of the CSMA/CA and the MSE error after reconstructing sensor values by Singular Value Thresholding(SVT) in Fusion Center is 87% of the CSMA/CA.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.61-67
• /
• 2008

In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

• Geophysics and Geophysical Exploration
• /
• v.14 no.2
• /
• pp.140-145
• /
• 2011

In order to analyze the influence of the noise on a cross-well traveltime tomography to detect a small scale low velocity body in a homogeneous medium, the first arrival travel times were computed one a tunnel model by a finite-difference ray tracing scheme. Three different types and four different intensity levels of white noises were added to the computed first arrival travel times, and velocity tomograms were constructed using an iterative inversion method (SIRT). Tomograms with the noise intensity up to 10% of the maximum traveltime delay in the tunnel model, showed the exact location of the tunnel. However, the velocity shown at the tunnel location was not close to air velocity but only slightly less than the velocity of the background medium. The additive random noise showed significantly less degree of influence on the resulting tomogram than the source- and receiver consistent noise.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.39-50
• /
• 2005

In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1229-1238
• /
• 2018

We examined if a state of sea-ice in Bering Sea acts as a prelude of variation in that of Chukchi Sea by using satellites-based Arctic sea-ice concentration time series. Datasets consist of monthly values of sea-ice concentration during 36 years (1982-2017). Time series analysis armed with Transfer entropy is performed to describe how sea-ice data in Chukchi Sea is affected by that in Bering Sea, and to explain the relationship. The transfer entropy is a measure which identifies a nonlinear coupling between two random variables or signals and estimates causality using modification of time delay. We verified this measure checked a nonlinear coupling for simulated signals. With sea-ice concentration datasets, we found that sea-ice in Bering Sea is influenced by that in Chukchi Sea 3, 5, 6 months ago through the transfer entropy measure suitable for nonlinear system. Particularly, when a sea-ice concentration of Bering Sea has a local minimum, sea ice concentration around Chukchi Sea tends to decline 5 months later with about 70% chance. This finding is considered to be a process that inflow of Pacific water through Bering strait reduces sea-ice in Chukchi Sea after lowering the concentration of sea-ice in Bering Sea. This approach based on information theory will continue to investigate a timing and time scale of interesting patterns, and thus, a coupling inherent in sea-ice concentration of two remote areas will be verified by studying ocean-atmosphere patterns or events in the period.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.481-487
• /
• 2013

This paper presents an FIR (Finite Impulse Response) fixed-interval smoothing filter for fast and exact estimating state variables of a discrete nonlinear system with modeling uncertainty. Conventional IIR (Infinite Impulse Response) filter and smoothing filter can estimate state variables of a system with an exact model when the system is observable. When there is an uncertainty in the system model, however, conventional IIR filter and smoothing filter may cause large errors because the filters cannot estimate the state variables corresponding to the uncertain model exactly. To solve this problem, FIR filters that have fast estimation properties and have robustness to the modeling uncertainty have been developed. However, there is time-delay estimation phenomenon in the FIR filter. The FIR smoothing filter proposed in this paper makes up for the drawbacks of the IIR filter, IIR smoothing filter, and FIR filter. Therefore, the FIR smoothing filter has good estimation performance irrespective of modeling uncertainty. The proposed FIR smoothing filter is applied to the integrated navigation system composed of a magnetic compass based DR (Dead Reckoning) and a GPS (Global Positioning System) receiver. Even when the magnetic compass error that changes largely as the surrounding magnetic field is modeled as a random constant, it is shown that the FIR smoothing filter can estimate the varying magnetic compass error fast and exactly with simulation results.

• Asian-Australasian Journal of Animal Sciences
• /
• v.12 no.4
• /
• pp.515-519
• /
• 1999

With the purpose of determining the influence of sexual partners on the oestrous behaviour and to evaluate the accuracy of predicting the time from implant withdrawal to sexual receptivity following a treatment with Synchromate B (SMB), 15 adult Brahman cows were used in each of three phases. During phase I and n, random pairs of animals were induced to display oestrus one pair after the other at daily intervals, while in phase III, cows were induced alternately, every other day, one cow on the 1st day, two on the 3rd, one on the 5th, two on the 7th until all cows were treated. Sixty six percent of the cows in phases I and II, and 80% in phase III came into oestrous after treatment. The interval between implant withdrawal and, expected and observed oestrous was statistically different in all phases. Clustering of oestrous was evident. Cows displayed sexual receptivity within a. range of -24 to +96; -24 to +72 and -216 to +192 hours after implant withdrawal for the three phases, respectively, with a tendency for cows treated first (within treatments), to delay their oestrus signs and vice versa. In phase III, four cows showed oestrous behaviour with the implant in place. These in spite of not observing pre-ovulatory follicles. Correlation values of 0.99, 0.93 and 0.90 (P<0.05) were found respectively among treatments, between the number of cows coming into oestrus and the number of mounts observed. These findings suggest that there are social and behavioural factors in a herd that may override exogenous synchronisation treatments.