• 한국통신학회논문지
• /
• 제32권12A호
• /
• pp.1226-1237
• /
• 2007

이 논문은 IEEE 802.16 기반의 무선 메쉬 네트워크를 위한 QoS 메쉬 라우팅 프로토콜을 제안한다. 본 논문에서 제안하는 QoS 메쉬 라우팅 프로토콜은 테이블 관리 (Table-driven or Proactive) 방식의 홉 간 (Hop-by-Hop) QoS 라우팅 프로토콜이다. 제안하는 라우팅 프로토콜의 목표는 송신 노드에서 목적지 노드까지 경로를 찾는 것 뿐만 아니라, 대역폭과 지연의 관점에서, QoS 요구사항을 만족시키는 최적 경로를 찾는 것이다. 이 논문에서, 우리는 먼저 이동 Ad Hoc 라우팅 프로토콜과 관련된 연구를 바탕으로, 라우팅 프로토콜의 유형을 분석하고, 테이블관리 방식의 홉 간 라우팅 프로토콜이 무선 메쉬 네트워크에 가장 적합함을 보인다. 그리고 나서, 본 논문에서 주목하는 IEEE 802.16 기반의 무선 메쉬 네트워크의 네트워크 모델을 소개하고, 테이블 관리 방식의 홉 간 라우팅 프로토콜을 기반으로 하는 QoS 메쉬 라우팅 프로토콜을 제안한다. 시뮬레이션을 통해서, 제안하는 라우팅 프로토콜이 QOLSR 프로토콜에 비하여 단대단 지연 (End-to-End Delay)이 낮고, 패킷 전달률 (Packet Delivery Ratio)이 높으며, 라우팅 오버헤드 패킷 량이 적음을 보였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.29-30
• /
• 1999

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.122-131
• /
• 2013

We address the problem of effective vehicular routing in hostile scenarios where malicious nodes intend to jeopardize the delivery of messages. Compromised vehicles can severely affect the performance of the network by a number of attacks, such as selectively dropping messages, manipulating them on the fly, and the likes. One of the best performing solutions that has been used in static wireless sensor networks to deal with these attacks is based on the concept of watchdog nodes (also known as guard nodes) that collaborate to continue the forwarding of data packets in case a malicious behavior in a neighbor node is detected. In this work, we consider the beacon-less routing algorithm for vehicular environments routing protocol, which has been previously shown to perform very well in vehicular networks, and analyze whether a similar solution would be feasible for vehicular environments. Our simulation results in an urban scenario show that watchdog nodes are able to avoid up to a 50% of packet drops across different network densities and for different number of attackers, without introducing a significant increase in terms of control overhead. However, the overall performance of the routing protocol is still far from optimal. Thus, in the case of vehicular networks, watchdog nodes alone are not able to completely alleviate these security threats.

• ETRI Journal
• /
• 제43권4호
• /
• pp.674-683
• /
• 2021

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.121-136
• /
• 2023

Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

• 한국항해항만학회지
• /
• 제30권9호
• /
• pp.773-777
• /
• 2006

Significant increase of container flows in the marine terminals requires more efficient port equipments such as logistic and transfer systems. This paper presents collision avoidance and routing approach based on dynamic programming (DP) algorithm for a linear motor based shuttle car which is considered as a new transfer system in the port terminals. Most of routing problems are focused on automatic guided vehicle (AGV) systems, but its solutions are hardly utilized for LM based shuttle cars since both are mechanically different. Our proposed DP is implemented for real-time searching of an optimal path for each shuttle car in the Agile port terminal located at California in USA.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.24-33
• /
• 2011

In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.179-186
• /
• 2006

There was a lot of research to integration of the transshipment and inventory problem in supply chain. Such a integration of inventory and transshipment problem called IRP (Inventory Routing Problem). We consider a distribution problem in which a set of products has to be shipped from a supplier to several retailers in a given planning horizon. Transshipment from the supplier to the retailer is performed by vehicles of limited capacity. Each retailer determines replenishment leadtime and order quantity with buffer management. A supplier determines optimal vehicle routing in supply chain. We suggest a heuristic algorithm which be used TOC buffer management in a replenishment problem and a tabu search algorithm in VRP (Vehicle Routing Problem).

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.822-824
• /
• 1997

The routing and surveying a transmission line should be done in advance of its construction. It is getting more difficult to construct transmission line day by day, due to the rapid increase of people's demand resulting from the recent change of social environment and people's consciousness. In order to solve these complicated conditions actively and rationally, it is necessary to be more scientific, objective and computerizable for the routing and surveying of a transmission line. New technologies on routing and surveying a 765kV transmission line are remote sensing, Global Positioning System and Optimal PowerLine system. Thanks to these technologies, there will be a contribution to making sure of the best quality and developing technolo91r of transmission line.

• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.278-281
• /
• 2008

Linear motor (LM) based shuttle cars will play an important role in the future transportation systems of marine terminals to cope with increasing container flows. These systems are known as agile port terminals because of their significant advantages. However, routing for multiple shuttle cars is still an open issue. We present a network model of a container yard and propose constrained dynamic programming (DP) for its routing strategy with collision avoidance. The algorithm is a modified version of typical DP which is used to find an optimal path for a single traveler. We evaluate the new algorithm through simulation results for three shuttle cars in a mesh-type container yard.