• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.55-70
• /
• 2005

In order to provide mobile hosts with multicast service in mobile communication environment, we proposed a multicast mechanism named HXcast++ which is an extended version of the existing Xcast++ with hierarchical architecture, We assured that mobile hosts could get multicast service through an optimal path regardless of their location by making DR(Designated Router) join a group on behalf of the mobile hosts, In this present research we introduced hierarchical architecture in order to reduce the maintenance cost resulting from frequent handoff. We also proposed a GMA (Group Management Agent) based group management mechanism which enables the mobile hosts to join the group without waiting for a new IGMP Membership Query. A fast handoff method with L2 Mobile Trigger was, in this work, employed in order to reduce the amount of the packet loss which occurs as a result of the handoff, We also managed to curtail the packet loss caused by the latency of the group join by using a buffering and forward mechanism.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.118-126
• /
• 2007

An ad hoc network is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies allowing people and devices to internetwork without any preexisting communication infrastructure. Although ad hoc network is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; ad hoc networks are known to be particularly vulnerable to security attack. It is difficult to establish a centralized key distribution center and a trusted certification authority to provide cryptographic keys and digital certificates to nodes. To prevent attacks in ad hoc routing protocols, many algorithms have been used. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is comprehensive solution for secure data forwarding in wireless multihop networks. With the simulation results, the proposed scheme is compared with existing source routing scheme.

• 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.

• Journal of the Korean Institute of Navigation
• /
• v.24 no.5
• /
• pp.343-360
• /
• 2000

The information technology(IT) development of telecommunication, along with the informationalization over the world, enables the firms to process their inner and outer operations through Electronic Data Interchange (EDI) system. And the concept of logistics has become more important to the enterprises in strategic sense because it had aggrandized itself to more comprehensive and integrative concept. Also the world shipping market is more competitive than any other market. In these environment, to maintain competitve power, shipping firms process operations by Logistics Information system(LIS), And then, reduce the working processes, working time and its costs. So the LIS has become more important in developing our national logistics system and industry. Therefore, this study purposes on empirically analyzing the activation factors of shipping LIS and the relationship these factors with logistic performances in the shipping industry. Considering environments of Shipping logistics information system, this study sets up the research model and hypothesis to examine the activation factors of shipping LIS and the relationship these factors with logistic performances. We used the field data on the 163 numbers of firms(29 overseas shipping companies and 133 forwarding Agency) to get the empirical evidence. According to the study results, The shipping LIS activation factors which the sample firms recognized as important: were top manager's support, well structured communication channel, strategic plan's connection and inner informationalization level. And IS organization ＆ human resources, IS discipline ＆ training, software development, IS organizational alignment, database management system, information standardization, competitive advantage, financial support and government support represent partially significant. Also, the current shipping LIS's main problems are expensive system cost, standardization of working process's, institution's imperfection and system's interaction defect. So these problems must be improved to activate shipping LIS.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.213-218
• /
• 2004

Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

• Journal of Power Electronics
• /
• v.16 no.4
• /
• pp.1324-1335
• /
• 2016

This article explores the speed regulation problem of permanent magnet synchronous motor (PMSM) systems subjected to unknown time-varying disturbances. A continuous sliding mode control (CSMC) technique is introduced for the speed loop to enhance the robustness of PMSM systems and eliminate the chattering phenomenon caused by high-frequency switch function in the conventional control law. However, the high control gain of the CSMC law in the presence of strong disturbances leads to large steady-state speed fluctuations for PMSM systems. In many application fields, PMSM systems are affected by time-varying disturbances instead of constant disturbances. For example, electric bicycles are usually affected by changing environmental disturbances, including wind speeds, road conditions, etc. These disturbances may be in the form of constant, ramp, and parabolic disturbances. Hence, a generalized proportional integral (GPI) observer is employed to estimate these types of disturbances. Then, the disturbance estimation method and the aforementioned CSMC method are combined to establish a composite sliding mode control method called the CSMC+GPI method for the speed loop of PMSM systems. Contrary to the conventional sliding mode control technique, the proposed method completely eliminates the chattering phenomenon caused by the switching function in the conventional control law. Moreover, a small control gain for the CSMC+GPI method is chosen by feed-forwarding estimated values to the speed controller. Hence, the steady-state speed fluctuations are small. The effectiveness of the proposed control scheme is verified by simulation and experimental result.

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

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

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

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• 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.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.