• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

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

Influence propagation is an important research issue in social networks. Influence propagation means that the status or the disposition of nodes get changed by new idea, information and gossip propagated by other nodes. Influenced nodes also make other nodes influenced across the network. The influence propagation problem based on 'word of mouth' referral is to find most influential nodes set in networks to maximize influence. In this paper, we study the influence measuring and finding most influential nodes set in Delay-Tolerant Networks. It is difficult to measure exact influential power in Delay-Tolerant networks where network topology is not stable due to the nodal mobility. In this paper, we propose a distributed scheme that each node constructs $k$-clique community structure and estimates local influential power in Delay-Tolerant Networks. Simulation results show that the influential nodes information estimated by proposed scheme is in agreement with a global view of influential nodes information.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.163-170
• /
• 2007

The next generation communication environment consists of various wireless access networks with distinct features that are configured as an overlay topology. In the network environments, the frequency of hand overs should be minimized and the error propagation should be solved in order to provide high-quality multimedia services to mobile users. Therefore, we propose an performance enhancement approach, based on mSCTP, that provides high quality multimedia services to mobile users by ameliorating the error propagation problem. We utilizes the following four functions: 1) the separation of transmission paths according to the types of frames. 2) retransmission strategy to minimize the loss rate of frames, 3) Foced vertical handover execution by utilizing bicasting, 4) using the stability period in order to reduce the effect of the ping pong phenomenon. The simulation results show that the proposed approach provides seamless multimedia service to mobile users by achieving error resilience.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.365-370
• /
• 2007

Connected Dominating Set(CDS) has been used as a virtual backbone in wireless ad hoc networks by numerous routing and broadcast protocols. Although computing minimum CDS is known to be NP-hard, many protocols have been proposed to construct a sub-optimal CDS. However, these protocols are either too complicated, needing non- local information, not adaptive to topology changes, or fail to consider the difference of energy consumption for nodes in and outside of the CDS. In this paper, we present two Timer-based Energy-aware Connected Dominating Set Protocols(TECDS). The energy level at each node is taken into consideration when constructing the CDS. Our protocols are able to maintain and adjust the CDS when network topology is changed. The simulation results have shown that our protocols effectively construct energy-aware CDS with very competitive size and prolong the network operation under different level of nodal mobility.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.465-470
• /
• 2010

In this paper we propose a method which can be used to enhance the reliability of E-ODMRP (Enhanced On-Demand Multicast Routing Protocol). E-ODMRP has low overhead compared to its predecessors since it performs periodic refresh at a rate dynamically adapted to the nodes' mobility and adopts the local recovery. Upon detecting a broken route, a node performs a local search to graft to the forwarding mesh proactively. However in E-ODMRP there is no packet recovery mechanism. A receiver may lose some packets when it is detached from the multicast tree. We propose a simple packet recovery mechanism that can be incorporated into E-ODMRP for enhanced reliability. We show via simulation that our mechanism effectively enhances the reliability of E-ODMRP.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.299-306
• /
• 2010

IPTV and VoIP services are considered as killer applications over Mobile WiMAX network, which provideshigh mobility and data rate. Among those which affect the quality of voice in those services, the jitter buffer or playout buffer can compensate the poor voice quality caused by the packet drop due to frequent route change or differences among routes between service endpoints. In this paper, we analyze the correlation between the sleep interval length and jitter buffer size in order to guarantee a predefined level of voice quality. For this purpose, we present an end-to-end delay model considering additional delay incurred by the WiMAX PSC-II sleep mode and a VoIP service quality requirement based on the delay constraints. Through extensive simulation experiments, we also show that the increase of jitter buffer size may degrade the voice quality since it can introduce additional packet drop in the jitter buffer under WiMAX power saving mode.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.491-498
• /
• 2010

Wi-Fi based vehicle-to-infrastructure (V2I) communication is an emerging solution to improve the safety, traffic efficiency, and comfort of passengers. However, due to the high mobility of vehicles and the limited coverage of Wi-Fi APs, the V2I system may suffer from frequent handoffs although roadside APs can support cost effective Internet connectivity. Such problem of V2I systems can be overcome with Mobile AP (MAP) platform. The MAPs yield longer service duration by moving along with vehicles, yet they provide a lower link capacities than the roadside APs. In this paper, we propose a new association control mechanism that effectively determines whether the vehicle will select a fixed roadside-AP or a nearby MAP in mobile vehicular network environments. We consider both the achievable link bandwidth and available connection duration as a selection criterion and provide their run-time estimation method. Extensive simulation using real traces show significant performance improvements.

• Journal of the Korean Society of Industry Convergence
• /
• v.19 no.1
• /
• pp.1-9
• /
• 2016

In this paper, we propose a new learning control scheme for various walk motion control of biped robot with same learning-base by neural network. We show that learning control algorithm based on the neural network is significantly more attractive intelligent controller design than previous traditional forms of control systems. A multi layer back propagation neural network identification is simulated to obtain a dynamic model of biped robot. Once the neural network has learned, the other neural network control is designed for various trajectory tracking control with same learning-base. The biped robots have been received increased attention due to several properties such as its human like mobility and the high-order dynamic equation. These properties enable the biped robots to perform the dangerous works instead of human beings. Thus, the stable walking control of the biped robots is a fundamentally hot issue and has been studied by many researchers. However, legged locomotion, it is difficult to control the biped robots. Besides, unlike the robot manipulator, the biped robot has an uncontrollable degree of freedom playing a dominant role for the stability of their locomotion in the biped robot dynamics. From the simulation and experiments the reliability of iterative learning control was illustrated.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.131-138
• /
• 2007

In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.1-7
• /
• 2010

Network Centric Warfare(NCW) is becoming a prominent concept in the current trend of warfare. To support high quality communication between strategic/tactical units in the concept of NCW, Tactical Airborne Networks are likely to be constructed in the near future to take part in the NCW. In these Tactical Airborne Networks with dynamic topology variations due to very high mobility of participants nodes, more efficient and reliable neighbor discovery protocols are needed. This paper presents the adaptive HELLO message scheduling algorithm for Tactical Airborne Network using directional antennas. The purposed algorithm can reduce the overhead of periodic HELLO message transfer, while guaranteeing successful data transmission. We concluded a mathematical analysis and simulation studies using Qualnet 4.5 for evaluation the performance and efficiency of the proposed scheme.