• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1720-1725
• /
• 2019

In this paper, we consider the efficiency of the scheme for for routing summary algorithms in discontiguous networks. Router than updating and transmitting the entire subnet information in the routing protocol, only the shortened update information is sent and the routing table is shortened to make the router resources more efficient and improve network stability and performance. However, if a discontiguous network is formed in the network design process, a problem arises due to the network contraction function and does not bring about the result of fundamental router efficiency. Using different major networks subnets one major network, causing problems in communication and routing information exchange if the configuration is incorrect. The algorithm proposed in this paper removes only the auto-summary algorithm from the existing algorithm, which increases the complexity and stability of the routing table and reduces the CPU utilization of network equipment from 16.5% to 6.5% Confirmed.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.623-632
• /
• 2005

In ad-hoc network, there is no fixed infrastructure such as base stations or mobile switching centers. The security of ad-hoc network is more vulnerable than traditional networks because of the basic characteristics of ad-hoc network, and current muting protocols for ad-hoc networks allow many different types of attacks by malicious nodes. Malicious nodes can disrupt the correct functioning of a routing protocol by modifying routing information, by fabricating false routing information and by impersonating other nodes. We propose a routing suity mechanism based on one-time digital signature. In our proposal, we use one-time digital signatures based on one-way hash functions in order to limit or prevent attacks of malicious nodes. For the purpose of generating and keeping a large number of public key sets, we derive multiple sets of the keys from hash chains by repeated hashing of the public key elements in the first set. After that, each node publishes its own public keys, broadcasts routing message including one-time digital signature during route discovery and route setup. This mechanism provides authentication and message integrity and prevents attacks from malicious nodes. Simulation results indicate that our mechanism increases the routing overhead in a highly mobile environment, but provides great security in the route discovery process and increases the network efficiency.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.403-408
• /
• 2005

다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반 하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정 알고리즘을 제안한다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1209-1218
• /
• 2001

In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1229-1232
• /
• 2003

Ad Hoc 네트워크에서 on demand 라우팅 프로토콜로 대표적인 AODV(Ad Hoc On Demand Distance Vector Routing)는 table driven 기반의 라우팅 프로토콜과 비교해 active route만을 라우팅 테이블에 저장하기 때문에 오버헤드가 작고 경로단절시 경로복구를 통해 경로 재설정할 수 있는 장점을 가지고 있으나 경로복구시 대역폭 낭비가 심하고 복구시간이 길다는 drawback을 가지고 있다. 이러한 단점은 많은 라우팅 패킷의 발생으로 기인하는 점이 있다. 본 논문에서는 Expanding Ring Search 알고리즘에서 time out은 timestamp를 이용하여 네트워크 상황에 맞게 가변적으로 적용하는 알고리즘을 개선하여 hop 수에 따라 node traversal time을 설정하도록 제안하였다. 제안한 알고리즘은 시뮬레이션을 통하여 검증하였으며 라우팅 패킷의 발생을 줄이고 throughput에서 향상을 보였다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.358-363
• /
• 2005

본 논문에서는 전력 제어를 통해 에너지 소비를 최소화하여 네트워크 수명을 극대화 시킬 수 있는 효율적인 라우팅 방안을 제안하였다. 제안한 프로토콜에서 센서 노드들은 여러 개의 단위 전력을 가지고 있어 독립적인 라우팅 테이블을 형성하게 된다. 이를 토대로 가장 에너지 소비가 적은 경로를 설정하여 데이터를 전송하게 된다. 또한 특정 노드가 더 이상 기능을 하지 못하는 경우에도 적응적으로 경로를 재설정하여 데이터를 전송할 수 있도록 설계하였다. 이렇게 제안한 프로토콜과 기존의 방식과의 비교 실험을 통해 제안한 라우팅 방식의 성능을 효율적 에너지 소비 측면에서 분석하였다. 그 결과 논문에서 제안한 프로토콜의 성능이 기존의 방식과 비교하여 향상되었음을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1551-1554
• /
• 2002

이동 네트워크의 사용이 증가하면서 이동노드(Mobile Node)에 IP를 부여하고 경로설정을 하는 이동 에이전트의 처리량도 함께 늘어날 것이다. 그러나 일반적인 시스템으로 구성한 이동 에이전트시스템은 일단 구성이 되고 나면 용량 증설이 쉬운 일이 아니다. 뿐만 아니라 홈 에이전트가 다운되었을 때 이동 노드에 대한 라우팅 테이블 갱신을 할 수 없어 이동 노드는 서비스를 받지 못할 수 있다. 그러나 시스템 구성 시 분산시스템을 이용한다면 이동노드가 증가하더라도 쉽게 시스템에 대한 용량의 증설이 가능하고 라우팅 테이블을 여러 곳에 분산함으로써 중단 없는 서비스를 약속할 수 있다. 또한 CCM을 사용함으로서 좀더 유연한 시스템 구성을 할 수 있는 이점이 있다.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.351-360
• /
• 2004

Most mobile agents are migrated to many mobile agent systems by the sequential node migration method. However. in this case, if some problems such as host's fault or obstacle etc. happened, mobile agent falls infinity walt or orphan states. Therefore, it is difficult to get an expectation effect as use of other distribution technologies because the required time for networking between nodes increases. And so, many researches have been performed to solve this problems. However, most of methods decide node migration based on passive routing table or detour hosts which have some problems. Actually, the researches for reducing the total required time for networking are insufficient yet. In this paper, to reduce the required time for networking of mobile agent we design an active routing table based on the information of implemented objects which are registered in the meta-table of naming agent. And also, for user's keyword, we propose an replication model that replicates many agent object according to the information and number of object references corresponding to meta-table. Replicated objects are migrated to mobile agent systems in parallel and it provides minimized required time for networking.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.109-113
• /
• 2011

In intelligent subway systems, UWB-based WiMedia D-MAC Protocol can be considered to send and receive multimedia data which requires high data rate. However, network devices which do not exist within 10 meters, the limited communication rage, can not communicate with each other because WiMedia does not support multi-hop communications. In this paper, we developed the algorithm to select a relaying device for multi-hop routing on WiMedia networks. In the first step, each device acquires information of neighbors through beacon and decides whether it is a normal or relaying device using the acquired information. In the next step, all devices can create the 2-hop routing table using the information received via relaying devices and the whole routing table for all devices on networks, eventually.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1284-1294
• /
• 2010

The ZigBee is one of the most important technologies for composing USN. It is one of the IEEE 802.15.4 standards to support personal area networks. It uses a hierarchical routing or an on-demand route discovery strategy as an address allocation method. A hierarchical routing doesn't use a routing table but only uses a child node or a parent node as an intermediate node for data delivery. Therefore, the ZigBee network's topology greatly affects the overall network performance. In this paper, we propose a more trustworthy algorithm than only using the depth and widely variable LQI during network formation, and moreover we propose an algorithm to measure network's trustworthiness. We simulate our algorithm using the NS-2 and implement our network using the MG2400 ZigBee module for verifying performance.