• 융합보안논문지
• /
• 제19권3호
• /
• pp.3-12
• /
• 2019

인터넷 상의 사용자가 목적지 시스템으로 정보를 전송할 수 있도록 라우팅 정보를 서로 교환하여 라우팅 테이블을 생성하고 변화된 정보를 업데이트 해주는 라우팅 프로토콜 중 가장 중요한 프로토콜이 BGP 이다. 본 논문은 현재 사용되고 있는 BGPv4의 취약성을 이용하여 악의적인 공격과 네트워크 관리자의 실수로 발생할 수 있는 문제점을 사전에 차단하는 방법과 BGP의 대표적인 보안 취약점에 대한 공격기법인 AS-PATH 공격에 대한 실제 공격실험을 수행하여 공격기법들을 분석하고, AS-PATH 공격을 식별하는 알고리즘을 제안하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권5호
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

• 한국통신학회논문지
• /
• 제34권3B호
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 추계종합학술대회
• /
• pp.65-69
• /
• 2001

네트웍 관리는 메일, 화상회의, 웹, 데이터베이스 소프트웨어 등이 작동하는 네트웍 환경에서 더욱 중요한 문제가 되고 있다. 데이터를 전송하는 브리지 또는 라우터가 네트웍 디자인의 관점에서 비효율적인 패스로 전송할 수 있다. 이 논문에서는 네트워크상에서 발생할 수 있는 우회 경로 패스를 발견하는 문제를 논의한다. SNMP MIB로부터의 정보를 사용하여 계층적 네트웍 구조 분석을 기반으로 우회경로 패스를 발견하는 새로운 알고리즘을 제시한다. 제안된 알고리즘을 증명하기 위해 미리 선언된 데이터를 가지고 시뮬레이션 한 결과 우회 경로를 발견함을 알 수 있다.

• Journal of Advanced Marine Engineering and Technology
• /
• 제32권8호
• /
• pp.1269-1277
• /
• 2008

Ships at sea cannot exchange data among them easily so far. Basically voice-oriented communication systems are the main methods, some of them utilize the HF radio systems at lower bit rates, and for higher bit rates, the Inmarsat or VSAT are adopted. None of them are used widely because of lower qualities and higher costs. There exist many technical and economical limits to have the Internet service just like on land such as the WWW service. In order to achieve the improved transmission rates of the maritime communication networks at farther sea, MANET(Mobile Ad Hoc Network) is one of the most practical models. In this paper, a new routing protocol named EZR (Expansive Search Zone Routing Protocol) is proposed, which is based on SANET (Ship Ad Hoc Network) model that has some different features from MANET and VANET (Vehicular Ad Hoc Network). The search zone for the shortest path is firstly found by EZR. If no path is searched in the zone, the zone is expanded according to the rule of EZR. The zone-expanding and path-searching procedures are repeated until the path is found out. The performance of EZR is evaluated and compared with LAR protocol which is one of the most typical routing protocols based on geographical information. The simulated results show that EZR is much better than LAR at sea environments in terms of routing success rate, route optimality, and a single index of performance combined the previous two metrics.

• 한국통신학회논문지
• /
• 제31권7B호
• /
• pp.652-659
• /
• 2006

애드 혹 네트워크에서 라우팅 알고리즘은 매우 중요한 연구 분야중의 하나이다. 기존의 라우팅 알고리즘은 현재의 네트워크 토폴로지 상황만을 고려하여 라우팅 경로를 설정하기 때문에 안정적인 라우팅 경로를 설정하는데 많은 어려움이 있다. 이와 같은 문제점을 해결하기 위해 수신 신호 세기를 이용하여 라우팅을 수행하는 알고리즘들이 제안되었지만, 이들은 평균 수신 신호 세기만을 고려하였기 때문에 라우팅 프로토콜의 성능 향상에는 한계가 있다. 따라서 본 논문에서는 평균 수신 신호 세기와 수신 신호 세기의 변화를 고려한 링크 안정성 기반의 라우팅 알고리즘을 제안하였다. 제안된 알고리즘의 성능을 분석하기 위해 다양한 환경에서의 모의실험을 수행하였으며, 그 결과 기존의 알고리즘보다 우수한 성능을 보임을 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제6권2호
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.384-393
• /
• 2015

This paper proposes an insect behavior-inspired routing algorithm for large-scale wireless mesh networks. The proposed algorithm is adapted from the behavior of an insect called Bombyx mori, a male silkmoth. Its unique behavior is its flying technique to find the source of pheromones. The algorithm consists of two steps: the shortest-path algorithm and the zigzag-path algorithm. First, the shortest-path algorithm is employed to transmit data. After half of the total hops, the zigzag-path algorithm, which is based on the movement of the male B. mori, is applied. In order to adapt the biological behavior to large-scale wireless mesh networks, we use a mesh topology for implementing the algorithm. Simulation results show that the total energy used and the decision time for routing of the proposed algorithm are improved under certain conditions.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• 한국통신학회논문지
• /
• 제29권11B
• /
• pp.946-955
• /
• 2004

드브르젼 그래프(dBG: de Bruijn graph)는 병렬 계산을 위한 구조나 인터커넥션 네트워크 설계에 사용되고 있다. dBG 지향 라우팅 알고리즘은 고장포용(fault tolerance) 라우팅과 최단 경로 라우팅에 포함되어 연구되고 있지만, 아직까지 dBG에서 고장 노드를 포함하지 않는 최단 경로(FFSP) 프로토콜에 대한 연구는 없는 실정이다. 네트워크는 계속하여 그 크기가 커지기 때문에 현실적으로 네트워크 장애는 피할 수 없는 일이 생기게 된다. 더욱이, 그러한 네트워크 장애에 대비하여 보통의 라우팅 알고리즘은 긴 지체 시간과 낮은 처리량 그리고 높은 트래픽을 발생시키게 된다. 본 논문은 양방향 드브르젼 그래프(BdBG)에 기반을 두고 네트워크 장애가 존재하는 상태에서의 두 가지 라우팅 알고리즘에 대하여 제안한다. 첫 번째는 알고리즘은 네트워크에 연결된 상태로 네트워크의 결함 노드가 존재할 경우에도 항상 최단거리 경로로 도달하게 하는 알고리즘이다. 두 번째 알고리즘은 첫 번째 알고리즘에 비해 최단 거리 경로를 찾아내는 성능을 높인 알고리즘이다. 두 알고리즘의 성능 평가 항목으로 경로 길이 측정과 이산 집합(Discrete Set: DS)의 크기를 정의하여 다른 알고리즘과 성능 평가를 비교하였으며, 성능 평가 결과 제안한 알고리즘들은 dBG 기반을 둔 실제 네트워크를 위한 라우팅에 적합하다는 결론을 얻었다.