• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.73-78
• /
• 2019

Due to frequent topology changes in wireless networks, inter-node link disconnection and path re-establishment occur, causing problems such as overloading control messages in the network. In this paper, to solve the problems such as link disconnection and control message overload, we perform path setup in three steps of the neighbor node discovery process, the route discovery process, and the route management process in the wireless network environment. The link stability value is calculated using the information of the routing table. Then, when the zone master monitors the calculated link value and becomes less than the threshold value, it predicts the link disconnection and performs the path reset to the corresponding transmitting and receiving node. The proposed scheme shows a performance improvement over the existing OLSR protocol in terms of data throughput, average path setup time, and data throughput depending on the speed of the mobile node as the number of mobile nodes changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.390-396
• /
• 2006

Policy-based Network Management(PBNM) in the Mobile Ad-hoc network(MANETs) requires additional, reliable and efficient mechanism over PBNM in wired network. Thus, it is important that the management system in MANETs should cluster the moving nodes and manage their movements in an effective manner. In this thesis, I propose a mechanism for the policy-based management in ad hoc networks in which I consider several methods to discover the Policy Decision Point(PDP), set the management area, and manage the movements of Policy Enforcement Point(PEP) nodes in the PBNM system. Moreover, COPS-PR is extended for the mechanism. Finally, I analyze and validate the results through simulations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.69-77
• /
• 2015

MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.447-454
• /
• 2006

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.

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

본 논문에서는 사용자의 다양한 단말환경에 맞게 보다 효율적으로 컨텐츠 변환 서비스를 제공하는 최적의 컨텐츠 변환 노드(Contents Translation Node: CTN) 검색 메커니즘을 개발하였다 이 메커니즘은 컨텐츠 변환 노드로 구성된 서비스 오버레이 네트워크에서 노드부하가 적고, 근거리에 위치한 최적의 노드를 선택하여 신속하고 효율적인 서비스 제공을 가능케 하고 노드간의 부하 배분 기능을 지원한다 그리고 털러 노드 성능 요인들 간에 가중치를 적용하여 현재 상황에 맞게 시의적절한 최적의 노드를 선택할 수 있게 한다. 또한 본 논문에서는 이 메커니즘을 이용하여 인터넷 컨텐츠 최적화 서비스를 제공하는 인터넷 컨텐츠 분산 관리 시스템 (Internet Contents Distribution Management System: ICOMS)을 설계하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.17-28
• /
• 2019

6LoWPAN based on IEEE 802.15.4 is a realistic standard platform for various Internet of Things (IoT) applications. To bootstrap the LoWPAN (Low-power Wireless Personal Area Network), each device must perform 6LoWPAN-ND address registration to assign a unique IPv6 address. Without adequate security mechanisms, 6LoWPAN-ND is vulnerable to a variety of security attacks including corrupted node attacks. Several security mechanisms have been proposed as a supplement to the vulnerability, but the vulnerability exists because it relies solely on IEEE 802.15.4 hop-by-hop security. In this paper, we propose and analyze a vulnerability of 6LoWPAN-ND address registration and a new security mechanism suitable for preventing the attack of damaged node. It also shows that the proposed security mechanism is compatible with the Internet Engineering Task Force (IETF) standard and is more efficient than the mechanism proposed in the IETF 6 lo WG.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.14-19
• /
• 2009

In Mobile Ad-hoc Network, link failure and packet loss may occur frequently due to its nature of mobility and limited battery life. In this paper, an enhanced robust routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance is presented. If the node movement is detected, the routing agent switches local path to its neighbor node. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.