• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3860-3875
• /
• 2014

Cognitive radio networks (CRNs) are composed of mobile users who can use multiple spectrum bands for communication. CRNs allow unlicensed users (called cognitive users) to efficiently utilize unused licensed spectrums without interfering with communications of licensed users (called primary users). The main goals of CRNs are to mitigate spectrum saturation and to improve spectrum utilization. This paper introduces state-of-the-art routing protocols for CRNs and addresses some limitations of these protocols. To resolve the limitations, we suggest a new research direction for routing protocols in CRNs. We implement our protocol to compare with the existing routing protocols for multi-hop CRNs. Our protocol shows good performance compared to the existing routing protocols in terms of network performance and PU protection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.4
• /
• pp.432-440
• /
• 2008

Korean shipbuilders are starting to use three dimensional solid CAD systems to enhance their competitiveness in design and production. Despite many merits, three dimensional CAD systems reveal some problems in pipe-line modeling. Pipe-line modeling is heavily dependent on point data in routing. However, since the models built by sweeping or skinning operations do not have data about points and lines on the surfaces, the point data for routing are currently manually calculated by considering the diameters of the pipes and alignment conditions with other pipes. This process is inefficient and prone to errors. In order to enhance the pipe modeling, this paper presents an Offset Routing Program for a three dimensional CAD system, which aids designers to easily define the start points and to generate the pipe routings using reference objects.

• IE interfaces
• /
• v.20 no.4
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2006.08a
• /
• pp.163-168
• /
• 2006

Nursing diagnosis process is described as nurses assessing the patients' conditions by applying reasoning and looking for patterns, which fit the defining characteristics of one or more diagnoses. This process is similar to using a typical document retrieval system if we consider the patients' conditions as queries, nursing diagnoses as documents, and the defining characteristics as index terms of the documents. However, there is a small fixed number of nursing diagnoses and infinite number of patients' conditions in a typical hospital setting. This state is more suitable to applying document routing mode of information access, which is defined as a number of archived profiles, compared to individual documents. In this paper, we describe a ROUting-based Nursing Diagnosis (ROUND) system and its Natural Language Processing-based query processing component, which converts the defining characteristics of nursing diagnoses into query representations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.974-985
• /
• 2016

Riverbed Modeler, which is a commercial packet-level discrete event simulator is used to model, design, and simulate complicated communication protocols and large-scale network. Riverbed Modeler got credit for its reliability in field of network simulation. In the MANET simulation environment using Riverbed Modeler, it is very complicated to add a new routing protocol into existing architecture of routing protocols because it is required lots of modifications of protocol recognition. In this paper, we propose Routing Adding Framework which can reduce errors or mistakes during modifying the existing routing support architecture. Routing Adding Framework is provided as a adapter API for protocol recognition. and it is only minimum modifications for protocol identifiers when a new routing protocol is added to the child process of manet_mgr process which manages routing protocols for IP layer. With Routing Adding Framework, we can reduce less than half modification. Then, we shows an example of implementation of a hybrid routing protocol AntHocNet using Routing Adding Framework, and we verify its design and application of the Routing Adding Framework by obtaining simulation result with similar result given by AntHocNet.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.2
• /
• pp.193-204
• /
• 2013

The growing logistics strategy of a company is to optimize their vehicle route scheduling in their supply chain system. It is very important to analyze for continuous pickups and delivery vehicle scheduling. This paper is a computational study to investigate the effectiveness of continuous pickups and delivery vehicle routing problems. These scheduling problems have 3 subproblems; Inbound Vehicle Routing Problem with Makespan and Pickup, Line-haul Network Problem, and Outbound Vehicle Routing Problem with Delivery. In this paper, we propose 5 heuristic Algorithms; Selecting Routing Node, Routing Scheduling, Determining Vehicle Type with Number and Quantity, and Modification Selecting Routing Node. We apply these Algorithms to S vehicle company. The results of computational experiments demonstrate that proposed methods perform well and have better solutions than other methods considering the basic time and due-date.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1281-1286
• /
• 2010

Ant-based routing methods belong to a class of ant colony optimization algorithms which apply the behavior of ants in nature to routing mechanism. Since the topology of mobile ad-hoc network(MANET) changes dynamically, it is needed to establish paths based on the local information. Subsequently, it is known that routing in MANET is one of applications of ant colony optimization. In this paper, we propose a routing method, namely EPMAR, which enhances SIR in terms of route selection method and the process upon link failure. The performance of the proposed method is compared with those of AntHocNet and SIR. Based on he analysis, it is proved that the proposed method provided higher packet delivery ratio and less critical link failure than AntHocNet and SIR.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.135-139
• /
• 2003

Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.719-728
• /
• 1997

In the AGV routing a vehicle can select the shortest route on which no conflicts are anticipated. The procedure includes time constraint and the node/arc occupation times of vehicles in order to locate the conflicting paths. The slight differences among AGV routing algorithms exist in identifying the conflict regions encountered while reaching out to the destination node. In this paper, a novel approach to the use of the re-routing scheme is presented. It will be used to minimize the travel distance of vehicles in a regular vehicle routing process rather than to cope with emergency situations. The proposed algorithm provides existing active vehicles with the ability of changing their current paths for a new vehicle whenever the equal-distance paths exist, in on attempt to optimize the AGV transportation system. This ability is possible because of the flexibility of on AGV system controlled by a computer system.