• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.276-280
• /
• 2008

Many dissemination protocols on the mobility support in wireless sensor networks have been designed based on the assumption that the movement trace of sinks, such as soldiers and fire fighters, is random. However, the mobility of the sinks in many applications, for example, the movement trace of a soldier on operation in a battle field, can be determined in advance. In this paper, we propose a Predictable Mobility-based Data Dissemination protocol that enables data to directly route from source nodes to moving sinks by taking into consideration predictable movement behavior of the sinks. We also show the superiority of the predictable mobility-based data dissemination protocol through the performance comparison with the random mobility-based data dissemination protocols.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.396-405
• /
• 2009

An interlocking equipment of railway signalling systems should have very high functional safety and reliability properties because of its vital railway protection functionality. In order to achieve the required safety and reliability level, an engineer, in general, designs and implements the interlocking equipment to operate under RTOS(Realtime Operating System) environment, and the control hardware architecture redundant to cope with the random failures of system or subsystem. In such an architecture, it's very difficult to implement the interlocking equipment to communicate with various interface systems including the signal operator's terminal. In this paper, we propose a dual ethernet network topology and dual packet seamless transfer protocol algorithm for railway signaling system such as the interlocking equipment. We verify in this paper that the proposed DPST protocol algorithm has the evidence of its robust properties against the random hardware faults and communication errors. The proposed communication structure and algorithm is implemented in the electronic interlocking equipment for the private railway system of Hyundai Steel Company and its performance and properties are validated on the guideline of European Railway Standard EN50159.

• Journal of the Korea Society for Simulation
• /
• v.28 no.1
• /
• pp.23-39
• /
• 2019

The use of drone-bots is demanded in times regarding the reduction of military force, the spread of the life-oriented thought, and the use of innovative technology in the defense through the fourth industrial revolution. Especially, the drone's surveillance and reconnaissance are expected to play a big role in the future battlefield. However, there are not many cases in which the concept of operation is studied scientifically. In this study, We propose search algorithms for reconnaissance drone through simulation analysis. In the simulation, the drone and target move linearly in continuous space, and the target is moving adopting the Random-walk concept to reflect the uncertainty of the battlefield. The research investigates the effectiveness of existing search methods such as Parallel and Spiral Search. We analyze the probabilistic analysis for detector radius and the speed on the detection probability. In particular, the new detection algorithms those can be used when an enemy moves toward a specific goal, PS (Probability Search) and HS (Hamiltonian Search), are introduced. The results of this study will have applicability on planning the path for the reconnaissance operations using drone-bots.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.123-131
• /
• 2009

Wireless networks have several unique features : node mobility, restricted bandwidth, time-variable bandwidth, large latency, and high bit error rates time due to channel fading. These features at wireless networks intend to decrease the performance TCP protocols are used in wireless networks. Lots of studies have been done for finding appropriate wireless transport protocols for current wireless communications. However, related studies have not provided good performance or some protocols have a good performance only in specific circumstances. Thus, these are not suitable for general wireless circumstance. Therefore, we propose a new wireless transport protocol which provides better performance than the previous ones. And we'd like to solve a problem that previous protocols cannot maintain their connections even though they have multiple paths until another path is successfully set up. To solve these problems, a new protocol ATP-M is proposed which is designed on already known TCP-M and ATP protocols. With NS-2 computer simulation, it is shown that this newly proposed protocol has better system throughput than TCP, TCP-M and ATP protocols.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.462-468
• /
• 2017

In this paper IoT/WSN(Internet of Things/Wireless Sensor Network) has been modeled with a random geometric graph. And a performance of the decentralized code for the efficient storage of data which is generated from WSN has been analyzed. WSN with n=100 or 200 has been modeled as a random geometric graph and has been simulated for their performance analysis. When the number of the total nodes of WSN is n=100 or 200, the successful decoding probability as decoding ratio ${\eta}$ depends more on the number of source nodes k rather than the number of nodes n. Especially, from the simulation results we can see that the successful decoding rate depends greatly on k value than n value and the successful decoding rate was above 70% when $${\eta}{\leq_-}2.0$$. We showed that the number of operations of BP(belief propagation) decoding scheme increased exponentially with k value from the simulation of the number of operations as a ${\eta}$. This is probably because the length of the LT code becomes longer as the number of source nodes increases and thus the decoding computation amount increases greatly.

• Knowledge Management Research
• /
• v.22 no.4
• /
• pp.119-133
• /
• 2021

As a large amount of data is produced in each industry, a number of time series pattern prediction studies are being conducted to make quick business decisions. However, there is a limit to predicting specific patterns in nonlinear time series data due to the uncertainty inherent in the data, and there are difficulties in making strategic decisions in corporate management. In addition, in recent decades, various studies have been conducted on data such as demand/supply and financial markets that are suitable for industrial purposes to predict time series data of irregular random walk models, but predict specific rules and achieve sustainable corporate objectives There are difficulties. In this study, the prediction results were compared and analyzed using the Chaos analysis method for roulette data and financial market data, and meaningful results were derived. And, this study confirmed that chaos analysis is useful for finding a new method in analyzing time series data. By comparing and analyzing the characteristics of roulette games with the time series of Korean stock index future, it was derived that predictive power can be improved if the trend is confirmed, and it is meaningful in determining whether nonlinear time series data with high uncertainty have a specific pattern.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.72-79
• /
• 2013

In wireless sensor networks, the selective wakeup scheme is one of the energy saving mechanisms, that is used for an object detecting or tracking. Recently, many protocols are proposed using the selective wakeup scheme for the continuous objects tracking such as forest fires and poison gas. They predict the future shape of continuous objects and activate only sensors in the predicted boundary area of the objects. It works correctly in a uniformly deployed wireless sensor networks. However, it cannot be directly applied to a randomly deployed sensor networks with voids. When the predicted area is in the void area, the activation message cannot reach and the predicted area cannot be activated at the right time. It leads to many detection errors for continuous object. Moreover, if a sensor is once foiled in a activation control then the next activation control might be continuously failed. The detection errors can be result in serious harm to people. In this paper, we propose a chaining selective wakeup scheme for robust continuous object tracking in wireless sensor networks. In our protocol, we collect the information of a void area during the network configuration time; if the next boundary area is in the void area, we activate the chained area surrounding the void area with activation control message.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.198-204
• /
• 2012

Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.331-340
• /
• 2008

In order to make load balancing, workload information of nodes should be informed to the network. In a load balancing algorithm[13] based on the SBIBD(Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O (${\upsilon}{\sqrt{\upsilon}}$) traffic overhead, where ${\upsilon}$ is the number of nodes. It is very efficient but works well only when ${\upsilon}=p^2+p+1$ for a prime number p. In this paper, we generate a special incidence structure in order for the algorithm works well for an arbitrary number of nodes. In the experiment with w,($5{\leq}w{\leq}5,000$), nodes and more than 80% of receiving workload information, traffic overhead was less than O ($w{\sqrt{w}})$ and the result for standard deviation of traffic overhead showed that each node has largely balanced amount of traffic overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.