• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.430-433
• /
• 2007

무선 센서 네트워크는 감지, 연산 그리고 무선 통신 능력을 갖는 수많은 작은 센서 노드들로 구성된다. 센서 네트워크에는 전장 감시, 침입자 추적, 그리고 고속 도로 감시 등과 같은 많은 응용분야가 있다. 이러한 분야에서는 사용자의 관심 대상이 되는 지역에서 발생 하는 사건들을 감시하기 위하여, 제한적인 에너지 자원과 연산 능력을 가진 세서 노드들로부터 감지된 데이터를 수집한다. 그러므로 센서 네트워크 응용분야에서의 데이터 수집과 전달, 센서 노드의 효율적인 에너지 소모는 매우 중요하며, 이를 위하여 센서 네트워크를 위한 라우팅, 전력관리, 그리고 데이터 보급 프로토콜들의 설계에서는 이러한 제약 사항들이 반드시 고려되어야 한다. 본 논문에서는 무선 센서 네트워크에서 효율적인 데이터 전달을 위한 라우팅 방법을 제안한다. 제안된 방법은 센서 노드의 트래픽 량, 잔여 에너지 량, 그리고 베이스 스테이션가지의 최단경로를 고려하여 데이터 전송 경로를 결정하여, 센서 네트워크에서의 에너지 효율적이면서도 안정적인 감지 데이터 전송을 가능하게 한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.431-433
• /
• 2016

In this paper, we propose an algorithm that analyzes characteristic nodes to select efficient relay nodes using message distribution. Existing delay-tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.428-437
• /
• 2006

Wireless ad-hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad-hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called Geographic Landmark Routing(GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1186-1194
• /
• 2012

In order to resolve the energy efficiency in wireless sensor networks, a multihop transmission technique is utilized. However, multihop transmission in wireless sensor networks (WSN) has pros and cons. It reduces total energy consumption, while it may cause a severe decrease in network lifetime. To solve this problem, we suggest the so called strike and bargaining algorithm (SBA). The routing path is determined by wages of nodes. Each node negotiates its wage with their neighbor nodes and determine a reasonable value to reach a optimally balanced point. By analysis and simulations, we show SBA can achieve a near optimal solution.

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.296-305
• /
• 2007

The HiLow, a hierarchical routing protocol for 6LoWPAN, needs smaller memory allocation and energy than other routing protocols. However, the HiLow has a weak point that does not provide the optimized routing path. In this paper, we propose the algorithm that can find the optimum next hop using neighboring nodes around the source node as well as hierarchical routing path information. We evaluate the performance of proposed algorithm using the computer simulation, and we can acquire results that decreases a number of hop count and transmitted message.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.11-22
• /
• 2009

For a wireless ad-hoc network, event routing algorithm of the publish/subscribe system is especially important for the performance of the system because of the dynamic characteristic and constraint network of its own. In this paper, we propose a new hybrid event routing algorithm. TopSim for efficient publish/subscribe system on the wireless ad-hoc network by extending the ShopParent algorithm by considering not only network overheads to choose a Parent of the publish/subscribe tree, but also topic similarity which is closeness of subscriptions. Our evaluation shows our proposed TopSim performs better for the case where a new joining node subscribed to the multiple topics and there is a node among Parent candidate nodes who subscribe to the ones in the list of multiple topics (related topics).

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.197-204
• /
• 2014

RIP, EIGRP, OSPF are the interior gateway protocol for sending and receiving routing information among routers in AS(Autonomous System). Various path selection methods using the metric in regard to them have been studied recently but there are few examples that the contents learners understand theoretically are verified by the practice. The Best Path is determined by calculating the Cost value based on the relevant topology of each routing protocol. After implementing the virtual network, it is certain that the results tracking and verifying the relevant path selection of each routing protocol are consistent with the Best Path. If methods suggested in this paper are applied properly, the relevant path selection process of routing protocol can be understood systematically. And it is expected that the outstanding results of learning will be able to be achieved.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.17-26
• /
• 2007

In this paper, we propose a basic virtual grid-based routing algorithm in order to devise an efficient routing method in ad hoc networks using the location information of nodes, energy level, etc. A packet is forwarded to the X-axis direction at first based on the location information of a destination node, and then it is forwarded to the Y-axis direction as its location becomes close to the destination from the viewpoint of the X-axis. Due to the selection of next hop nodes to deliver a packet from a certain node to a destination node, we can regard the whole network as a virtual grid network. The proposed routing algorithm determines routing paths using the local information such as the location information of a destination and its neighbor nodes. Thus, the routing path setup is achieved locally, by which we can expect reduction in network traffics and routing delays to a destination. To evaluate the performance of the proposed routing algorithm, we used the network simulator ns2 and compared its network throughput with that of an existing routing algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1497-1500
• /
• 2005

멀티캐스트는 실시간 멀티미디어 전송 등에서 그 중요성이 매우 커지고 있다. 이러한 응용 기술들은 네트워크의 QoS(Quality of Service)보장을 위해 많은 자원을 필요로 한다. 네트워크의 자원은 한정되어 있기 때문에, 효율적인 자원의 사용을 위해서는 효율적인 멀티캐스트 라우팅 경로를 설정하는 것이 결정적 수단이다. 최소비용 멀티캐스트 라우팅 문제는 다양한 트리 최적화 문제를 해결하기 위한 기본적인 문제이며 다양한 연구가 있어왔다. 제안하는 알고리즘은 최소비용멀티캐스트 트리를 생성하는 휴리스틱 알고리즘으로 잘 알려진 TM 알고리즘과 가중치를 사용하여, 멀티캐스팅의 다양한 트리 최적화 문제에 적용되어 QoS에 따른 네트워크 자원의 사용효율을 극대화 하는데 기여할 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.176-180
• /
• 2008

무선 메쉬 네트워크는 최근 무선 네트워크 환경에서 유선을 효율적으로 연장할 수 있는 기술로서 주목 받고 있으며 무선 백본망을 통해 저렴한 비용으로 광대역 네트워크 인프라를 구성하는 기술이다. 무선 메쉬 네트워크는 기존 네트워크 기술과는 달리 노드의 이동성이 적고 에너지 영향도 덜 제한적인 특징을 가지고 있다. 따라서 이러한 네트워크 특성을 반영할 수 있는 경로 설정 기술이 필요하며 적합한 경로를 결정하기 위한 새로운 라우팅 메트릭이 요구된다. 본 논문에서는 데이터를 효율적으로 전달하기 위해 노드 간 링크 성능과 노드의 부하를 고려한 새로운 라우팅 메트릭을 제안한다.