• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.50-58
• /
• 2001

Modern day networks are increasingly moving towards peer to peer architecture where routing tasks will not be limited to some dedicated routers, but instead all computers in a network will take part in some routing task. Since there are no specialized routers, each node performs some routing tasks and information passes from one neighbouring node to another, not in the form of dumb data, but as intelligent virtual agents or active code that performs some tasks by executing at intermediate nodes in its itinerary. The mobile agents can run, and they are free to d other tasks as the agent will take care of the routing tasks. The mobile agents because of their inherent 'intelligence'are better able to execute complex routing tasks and handle unexpected situations as compared to traditional routing techniques. In a modern day dynamic network users get connected frequently, change neighbours and disconnect at a rapid pace. There can be unexpected link failure as well. The mobile agent based routing system should be able to react to these situations in a fact and efficient manner so that information regarding change in topology propagates quickly and at the same time the network should not get burdened with traffic. We intend to build such a system.

• 한국멀티미디어학회지
• /
• 제12권4호
• /
• pp.28-40
• /
• 2008

Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

• International journal of advanced smart convergence
• /
• 제6권1호
• /
• pp.57-67
• /
• 2017

In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH - Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.

• Smart Structures and Systems
• /
• 제14권4호
• /
• pp.617-641
• /
• 2014

The energy constraint is still a common issue for the practical application of wireless sensors, since they are usually powered by batteries which limit their lifetime. In this paper, a practical compound energy efficiency strategy is proposed and realized in the implementation of a real time wireless sensor platform. The platform is intended for wireless structural monitoring applications and consists of three parts, wireless sensing unit, base station and data acquisition and configuration software running in a computer within the Matlab environment. The high energy efficiency of the wireless sensor platform is achieved by a proposed adaptive radio transmission power control algorithm, and some straightforward methods, including adopting low power ICs and high efficient power management circuits, low duty cycle radio polling and switching off radio between two adjacent data packets' transmission. The adaptive transmission power control algorithm is based on the statistical average of the path loss estimations using a moving average filter. The algorithm is implemented in the wireless node and relies on the received signal strength feedback piggybacked in the ACK packet from the base station node to estimate the path loss. Therefore, it does not need any control packet overheads. Several experiments are carried out to investigate the link quality of radio channels, validate and evaluate the proposed adaptive transmission power control algorithm, including static and dynamic experiments.

• 한국산업정보학회논문지
• /
• 제18권6호
• /
• pp.61-70
• /
• 2013

본 논문에서는 ITS(Intelligent Transport System)인 VANET 환경에서 사고발생 시에 차량 속도와 방위각을 이용하여 경로 단절을 최소화시키면서 응급메시지를 신속하고 정확하게 전송할 수 있는 SARPE(Speed and Azimuth based Routing Protocol for Emergency) 시스템을 제안한다. SARPE 시스템은 다중 경로 탐색 및 경로 선정 작업 시에 불필요한 메시지 및 작업량을 최소화하기 위하여 방위각을 기반으로 경로 탐색을 수행하고, 근원지와 목적지 차량의 평균 속도와 탐색한 경로 내 차량 속도(최대속도, 최소속도)의 차를 이용하여 경로 단절 발생 확률이 적은 경로를 선택한다. 그 결과, 경로 단절로 인해 생기는 경로 재탐색 작업을 최소화하며, 응급메시지를 신속하고 정확하게 전송할 수 있다.

• 한국정보통신학회논문지
• /
• 제14권5호
• /
• pp.1139-1145
• /
• 2010

무선 메쉬 네트워크는 무선 인프라 환경에서 고정이나 이동 중에 모든 노드가 통신을 할 수 있는 다중 경로를 가지는 새로운 네트워크이다. 하지만 무선 메쉬 네트워크는 유선망과 달리 무선 매체를 사용하기 때문에 경로손실, 간섭, 핸드오프 등으로 높은 패킷 손실률을 보이고 TCP(Transport Control Protocol) 알고리즘은 무선 메쉬 네트워크의 패킷손실 원인을 네트워크 내의 혼잡으로 인식하기 때문에 TCP 혼잡제어 알고리즘(Congestion Control Algorithm)을 실행하게 된다. 따라서 본 논문에서는 무선 메쉬 네트워크 환경에 적응력을 가지도록 기존의 TCP 혼잡제어 알고리즘의 혼잡 윈도우 값을 노드의 이동에 따라 유연하게 조절하는 새로운 TCP 혼잡제어 알고리즘을 제안한다.

• Journal of Information Processing Systems
• /
• 제17권5호
• /
• pp.905-917
• /
• 2021

In recent years, edge computing technology consists of several Internet of Things (IoT) devices with embedded sensors that have improved significantly for monitoring, detection, and management in an environment where big data is commercialized. The main focus of edge computing is data optimization or task offloading due to data and task-intensive application development. However, existing offloading approaches do not consider correlations and associations between data and tasks involving edge computing. The extent of collaborative offloading segmented without considering the interaction between data and task can lead to data loss and delays when moving from edge to edge. This article proposes a range segmentation of dynamic offloading (RSDO) algorithm that isolates the offload range and collaborative edge node around the edge node function to address the offloading issue.The RSDO algorithm groups highly correlated data and tasks according to the cause of the overload and dynamically distributes offloading ranges according to the state of cooperating nodes. The segmentation improves the overall performance of edge nodes, balances edge computing, and solves data loss and average latency.

• 대한건축학회논문집:구조계
• /
• 제34권5호
• /
• pp.3-11
• /
• 2018

Since the tensegrity structure is flexible and variable, the study on the mobility to the tensegrity has been conducted. However, it is difficult to apply the tensegrity to the architecture field due to several limits. This paper describes the methodology for the analysis of the shape change process of single prism tensegrity structure as an initial study. To apply the tensegrity structure to the architectural field, the assemblage and mathematical formulation procedures of the single prism tensegrity structures are carried out. And single prism tensegrity are presented to the computational strategies for simulate the shape change of those structures. Next, the investigation of structural behaviors through various cases of target displacements is described. Also, the summary of these methods in algorithms is illustrated. As a result it is confirmed that the single prism tensegrity structure model converges 99% on average to a given target node by using the proposed algorithm. Therefore, it is confirmed that the proposed algorithm and program are suitable for shape change analysis of single prism tensegrity structure model.

• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.518-536
• /
• 2021

Studies and applications related to unidirectional flow are gaining attention from researchers across disciplines in the recent years. Flow can be viewed as a concept, where the material, fluid, people, air, and electricity are moving from one node to another over a transportation network, water network, or through electricity distribution systems. Unlike other networks such as computer networks, most of the flow networks are visible and have strong material existence and are responsible for the flow of materials with definite shape and volume. The flow of electricity is also unidirectional, and also share similar features as of flow of materials such as liquids and air. Generally, in a flow network, every node in the network participates and contributes to the efficiency of the network. In this survey paper, we would like to evaluate and analyze the depth and application of the acyclic nature of unidirectional flow in several domains such as industry, biology, medicine, and electricity. This survey also provides, how the unidirectional flow and flow networks play an important role in multiple disciplines. The study includes all the major developments in the past years describing the key attributes of unidirectional flow networks, including their applications, scope, and routing methods.

• 유통과학연구
• /
• 제14권5호
• /
• pp.107-114
• /
• 2016

Purpose - Loading can decrease the productivity due to the possibility of carrying out with the opposite order of storage in container terminal. When the container is to be taken out, it is needed to move the container stacked upon the container to be carried out to other place temporarily. It is called as rehandling. Remarshalling, with the loading plan, is the arranging the containers before the ship arrives in order to avoid the rehandling during the carrying out. The present study tried to find out the factors affecting the efficiency when building the remarshalling plan with the utilization of neighboring storage space as a outer slot, and analyzed the efficiency of several remarshalling algorithms with the combination of those factors. Research design, data and methodology - The present study used, when the remarshalling plan is prepared for utilizing the outer slot, the simulation methods in order to compare the efficiency of the remarshalling algorithms which made with the factors affecting the efficiency. The factors affecting the efficiency are the method of making the child node, method of arrangement, and possibility of application of FIX. In order to analyze the affecting factors on the efficiency, several algorithms are prepared with the combination of production of the child node and the arrangement method with the availability of FIX application. With this algorithm, the effect of the factors on the efficiency after building up of remarshalling plan with the target on the bay with 10 rows, 8 columns, and 10 indices. Results - The method of rearrangement and making of a child node as the factor affecting the efficiency of remarshalling utilization of the outer bay were studied. It is efficient to combine the method of making a child node with MCS in order to reduce the number of moving the containers. For reducing the time in carrying out, it was found that all arrangement methods should be combined with RCS for the efficiency. The result of experiment shows the application of FIX with good result in case of succession ratio. In addition, when FIX was not applied, all of the most combinations resulted in short time in remarshalling. As a result, it can be concluded that the algorithm with proper combination of making the child node and the arrangement can increase the job efficiency based on the importance. Conclusion - The present study suggested and analyzed the algorithms with the combination of the arrangement method, the making of child node, and FIX. It is needed to develop the algorithm to judge the possibility whether the best remarshalling plan can be built or not within the bay in order to find a better method between the two cases such as within the bay and outer the bay. As a method for extending the study on the factors affecting the efficiency, it is possible to find out the way to build the remarshalling plan within the permitted time under any storage situation.