• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.228-239
• /
• 2005

In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.

• The Journal of the Korea Contents Association
• /
• v.8 no.9
• /
• pp.34-41
• /
• 2008

Existing mobility support scheme like MIPv4 has the delay at data transfer and Triangle routing problem. This paper proposes the new mobility support scheme and method that can overcome the problem using MPLS LSP in Next Generation Network. The proposed scheme overcomes the problem by introducing the LMS(Location Management Server) managing the location of the mobile terminal and the MPLS LSP between FA for a tunneling. We shows on the mathematical analysis using the queuing theory that this proposed scheme is more superior to the existing method(MIP).

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.327-336
• /
• 2009

Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wire-less sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.154-157
• /
• 1999

Photonic Slot Routing(PSR) is a promising approach to solve the fundamental scalability problem of all-optical packet switched WDM networks. In photonic slot routing, packets destined for the same subnetwork are aggregated to form a photonic slot which is jointly routed as a single unit of information through the network. The relative location of the nodes from bridge may cause to fairness problem in the unidirectional WDM ring network based on PSR. As photonic slots from different subnetworks can originate contentions at the bridge, packets may be dropped and retransmitted. Thus we evaluated the performance of PSR based WDM ring network in the point of fairness for each node and slot contentions at the bridge. Simulation results show that the PSR based WDM ring requires a slot access mechanism to guarantee the transmission fairness and efficient switch architecture to resolve slot contention at the bridge.

• Journal of Advanced Navigation Technology
• /
• v.18 no.3
• /
• pp.236-241
• /
• 2014

In a mobile ad hoc networks, multi-hop transmission is used to transfer data from source node to destination node and the routing protocol is the one of the important technical issues. The links between nodes can be unstable due to the changes of node location and channel conditions, and it can induce link error. To solve this problem, multipath routing was proposed. Multipath routing can reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing technique in the multi-rate MANET. The proposed multipath routing can avoid interference without the knowledge of node location. Simulation results show that the proposed multipath routing can reduce transmission delay and error.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.65
• /
• pp.81-88
• /
• 2001

In logistics decision making, Key elements in the design of any physical distribution are the location of depots and the distribution of goods from the depots to the customers. Considering open and close the depots, This paper presents a flexible analysis on the combined location-routing problem(LRP) the case for variation capacity of vehicle and customers demands each. The scenario examples are given the use of heuristic(Saving-Drop) in LRP types. The results is useful in apply to the logistics environment changes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2243-2250
• /
• 2014

In wireless sensor networks(WSNs), geographical routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Especially, indoor environments contain various obstacles such as concrete wall, furniture which cause non-line-of-sight(NLOS) conditions. To solve the problem, we propose location error compensation algorithm by using two difference topology constructions. First topology is based on mobile node's location which is obtained from anchor nodes. Second topology is based on mutual distance from neighbor nodes. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1058-1069
• /
• 2015

In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.