• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.133-146
• /
• 2010

The objective of this study is to develop a supply chain-based freight distribution channel choice model considering shippers' logistics behaviors which will be used for freight demand estimation. For this purpose, this study utilized the distribution channel data of the petrochemical and automobile industries collected by KTDB center. The distribution channel choice models for these industries were developed by including transport mode, time, cost, and shipment size. It was found that the multinomial logit model with transport cost, time and shipment size is the best, and as shipment increases, bigger transport mode is preferred. Generally direct distribution channel with small truck was preferred over the one using distribution center and/or big truck.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.262-264
• /
• 2004

본 논문에서는 소수 노드가 대부분의 네트워크 트래픽을 차지하는 실제 트래픽 형태에서 이동 애드혹 네트워크가 효율적으로 동작하기 위한 선택적 경로 탐색 라우팅 프로토콜을 제안한다. 선택적 경로 탐색 라우팅 프로토콜은 각 송신노드마다 자주 사용되는 목적노드를 주기적으로 선별하고 주기적인 RREQ 메시지를 보냄으로써 빠른 응답성을 가지도록 한다. 마지막으로 모의실험을 통해 우리가 제안한 방법이 기존의 On-Demand 라우팅 프로토콜보다 우수함을 보인다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1534-1541
• /
• 1996

Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.209-217
• /
• 2005

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources' costs for precomputation schemes in hierarchical routing is proposed. and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.5 no.1
• /
• pp.19-29
• /
• 2002

In this paper, the selection of transport route for import-export container cargo based on the sacrifice model and CO₂ emission was investigated. At first, the transportation of import-export container cargo, the transport share of each transport route, the CO₂ gas emission, the sacrifice model and the time value of import-export container cargo were investigated. And next, the selection of transport route based on the sacrifice model was investigated for the transport of import-export container cargo from Seoul to Pusan Port. Finally, the transport route was also selected by using the sacrifice model including the effect of CO₂ emission. The research results show that the transport route selection results of import-export container cargo based on the sacrifice model represents the present status of the transportation of import-export container cargo very well. And also the research results show that the reduction of transport time was very effective to increase the share of coastal transportation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.38-45
• /
• 2003

Recently, localized QoS routing scheme was recently proposed for overcome drawbacks of global state QoS routing schemes. Localized QoS routing dose not exchange QoS states among routers, but use virtual capacity based routing scheme instead. In localized QoS routing, to archive good performance, a set of candidate paths must be selected between the source and the destination effectively. In this paper we propose a few heuristics for effective path selection and develop path selection algorithms based on the heuristics. More detail analysis of the proposed algorithm is presented with simulation results which demonstrate that the path selection method can very affect the performance of localized QoS routing.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.304-307
• /
• 2007

센서 네트워크 응용 분야에서 센서 노드들은 무인 환경에서 배치되므로, 물리적인 공격들과 노드가 가진 암호 키들이 손상되기 쉬운 취약성을 가진다. 공격자는 노드를 훼손시켜 위조 보고서를 침투 시킬 수 있고, 이는 거짓 경보를 유발시켜 네트워크의 제한된 에너지의 고갈을 야기한다. 이러한 문제점을 보안하기 위해 최근 연구자들은 통계적 여과 기법을 통해서 위조 보고서를 탐지하고 도중에 여과시키는 방안을 제시하였다. 이 제안된 방안에서 각 노드는 검증을 위한 일정한 양의 정보를 가지며, 탐지 능력은 라우팅 경로의 선택에 의해 영향을 받는다. 본 논문에서는, 퍼지를 사용하여 통계적 여과 기법의 위조 보고서 탐지 능력 향상을 위해 네트워크 전체 상황을 고려하여 거짓 보고서 침투 공격에 대해 가장 안전한 경로를 선택하는 방법을 제안한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.11a
• /
• pp.9-13
• /
• 1997

본 논문에서는 two-ray 시간선택성 레일레이 페이딩 채널상에서 DPSK 신호를 차동검출 (differential detection)할 때 심볼에러율을 분석한다. 현재까지 수행된 많은 연구는 주파수 선택성 페이딩 채널 및 단일 경로 시간선택성 페이딩 채널을 대상으로 하였고, 다경로 시간선택성 페이딩 채널을 대상으로 한 예는 극히 드물다. 또한 다경로 시간선택성 페이딩 채널을 가장 간단히 모델링 할 수 있는 two-ray 페이딩 채널에 대한 연구도 지금까지 수행된 예가 극히 적다. 본 논문에서는 심볼열의 형태에 따라 수신신호들간의 관계를 세가지 그룹으로 나눈 후 각각의 경우에 대하여 위상 옵셋값을 계산하는 방식을 취하였다. 이와 같이 계산된 위상옵셋과 신호대 잡음비를 인자로 하여 차동검출된 신호가 가지는 위상의 확률밀도 함수를 계산하고 이 함수를 이용하여 심볼에러율을 계산하였다. 결과로부터 two-ray 페이딩 채널의 특성을 결정짓는 지연시간과 지연신호의 전력이 증가함에 따라 위상 옵셋값 및 에러율이 모두 증가하는 것을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.42-50
• /
• 2008

Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

• Journal of the HCI Society of Korea
• /
• v.5 no.2
• /
• pp.25-31
• /
• 2010

This paper proposes a hybrid tour path planning system for multiple visitors in a museum. The proposed path planning system merges individual user profiles into a group profile by exploiting the multiplicative utilization algorithm. It then generates a tour path for the users based on mixed initiative decision of the system and the involved visitors. It automatically selects visiting sites when group users have highly similar preferences while it asks users to select their appropriate visiting sites among available sites when their preferences are different. We developed the hybrid path planning system based on a tabletop display and evaluated it with four different exhibition settings and 11 participants. We found that the mixed decision of the system and users was useful in building a tour path for a group of visitors.