• Journal of Aerospace System Engineering
• /
• v.15 no.4
• /
• pp.75-84
• /
• 2021

A novel robot-operating-system-based flight and mission state communication node for X-Plane 11 flight control simulation environments and its simulation results were discussed. Although the proposed communication method requires considerable implementation steps compared with the conventional MATLAB/Simulink-based User Datagram Protocol (UDP) block utilization method, the proposed method enables a direct comparison of cockpit-view images captured during flight with the flight data. This comparison is useful for data acquisition under virtual environments and for the development of flight control systems. The fixed/rotary-wing and ground terrain elements simulated in virtual environments exhibited excellent visualization outputs, which can overcome time and space constraints on flight experiments and validation of missionary algorithms with complex logic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2892-2913
• /
• 2016

Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.341-350
• /
• 2020

In a wireless sensor network (WSN), the data transmission technique based on the cooperative multiple-input multiple-output (CMIMO) scheme reduces the energy consumption of sensor nodes quite effectively by utilizing the space-time block coding scheme. However, in networks with high node density, the scheme is ineffective due to the high degree of correlated data. Therefore, to enhance the energy efficiency in high node density WSNs, we implemented the distributed source coding (DSC) with the virtual multiple-input multiple-output (MIMO) data transmission technique in the WSNs. The DSC-MIMO first compresses redundant source data using the DSC and then sends it to a virtual MIMO link. The results reveal that, in the DSC-MIMO scheme, energy consumption is lower than that in the CMIMO technique; it is also lower in the DSC single-input single-output (SISO) scheme, compared to that in the SISO technique at various code rates, compression rates, and training overhead factors. The results also indicate that the energy consumption per bit is directly proportional to the velocity and training overhead factor in all the energy saving schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1827-1834
• /
• 2013

The existing PC-based desktop environment is being changed to a server-based virtual desktop environment due to various advantages such as security, mobility, and upgrade cost reduction. In this paper, a virtual computing lab service system which is applicable to the existing computer lab is designed and implemented using both an open source-based cloud computing platform and hypervisor. In addition, a node power scheduler is proposed in order to reduce power consumption in a server farm. The experimental results show that the power scheduler reduces power consumption considerably over the server farm without the power scheduler.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.3
• /
• pp.332-337
• /
• 2016

The rapid reconstruction of a transfer path is caused by frequent secession of nodes in many applications using overlay multicast. For this, however, many studies have been proposed, but a study of fast path recovery is required. This paper proposes a new method for fast path recovery to improve the path reconstruction time and for stable path maintain caused by the sudden secession of the parent node on overlay multicast. The proposed method uses the virtual transfer path and the candidate parent node for the fast path recovery. All nodes exchange periodically the RTT (Round Trip Time) information between the other nodes of similar position itself and neighboring node. All nodes have a candidate parent node list, and each node stores the exchanged RTT information on the list. Each node constructs the virtual transfer path to reduce the recovery time after deciding a candidate parent node that is one of them by the RTT order. In this way, when the parent node is seceded, all nodes can recover the transfer path quickly using the virtual transfer path. The simulation result showed that the recovery time of the proposed method is an average 30% faster than the known method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1639-1645
• /
• 2020

In this paper, we propose a virtual full-duplex relaying scheme based on data ferrying using two unmanned aerial vehicles (UAVs). By utilizing high mobility of two UAVs, the proposed relaying scheme can make each UAV communicate with a source node or a destination node when the UAV is near the source node or the destination node. The proposed relaying scheme can overcome the performance limitations of the half-duplex relaying and the implementation constraints of the full-duplex relaying. In addition, we propose an algorithm to shift the center point of two UAVs' trajectory with consideration of inter-relay interference (IRI). We show the simulation results of our proposed trajectory's center point shift algorithm. From the simulation results, it is shown that our proposed relaying scheme can achieve higher end-to-end spectral efficiency (SE) than the conventional static relaying scheme.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.17-26
• /
• 2007

In this paper, we propose a basic virtual grid-based routing algorithm in order to devise an efficient routing method in ad hoc networks using the location information of nodes, energy level, etc. A packet is forwarded to the X-axis direction at first based on the location information of a destination node, and then it is forwarded to the Y-axis direction as its location becomes close to the destination from the viewpoint of the X-axis. Due to the selection of next hop nodes to deliver a packet from a certain node to a destination node, we can regard the whole network as a virtual grid network. The proposed routing algorithm determines routing paths using the local information such as the location information of a destination and its neighbor nodes. Thus, the routing path setup is achieved locally, by which we can expect reduction in network traffics and routing delays to a destination. To evaluate the performance of the proposed routing algorithm, we used the network simulator ns2 and compared its network throughput with that of an existing routing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• Convergence Security Journal
• /
• v.17 no.5
• /
• pp.87-92
• /
• 2017

MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.463-465
• /
• 2002

급증하는 인터넷 관련 기술들과 사용자들을 현재의 네트워크 기반 구조로 포용하기에는 한계가 있다. 사용자들은 끊임없이 새로운 서비스들을 요구하고 현재의 망은 그러한 다양한 서비스들을 제공하기 위한 하부구조들이 정의되어 있진 않은 실정이다. 새로운 네트워크 하부 구조를 정의하는데 소요되는 비용과 새로운 서비스들을 제공하기 위해 개발될 프로토콜의 적용 비용을 줄이기 위해서 제안된 것이 액티브 네트워크의 개념이다. 사용자 기반의 네트워크환경을 제공하는 액티브 네트워크는 실행 환경과 노드 운영체제로 구성되어 있는 구조를 제공하며 바로 이 실행 환경을 이용해 노드 사용자들은 가상 액티브 노드를 만들어 새로운 서비스를 생성할 수 있다. 본 논문에서는 노드 사용자에 의해서 생성되는 가상 액티브 노드를 위한 MIB의 관리 구조에 대해서 제안하였으며 마크업 언어인 XML을 적용하여 기존의 표준 망 관리 프로토콜인 SNMP와도 호환성을 가질 수 있고 다양한 MIB 표현을 지원할 수 있는 구조를 제안하였다.