• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.105-113
• /
• 2008

While the wireless sensor network has a strong point which does not have effect on whole activities of network even though neighboring sensor nods fail activities of some sensor nod or make some functions disappear by the characteristic of similar information detection, it has problems which is slowing down of wireless medium, transfer character with severe error, limited power supply, the impossibility of change by optional arrangement of sensor nods etc. This paper proposes PRML techniques which performs the fittest course searching process to reduce power consumption of entire nods while guarantees the scalability of network organizing sensor nods hierarchically. The proposed technique can scatter the load of cluster head by considering the connectivity with surplus energy of nod and reduce the frequency of communication among the nods. As a result of the analysis in comparison with LEACH-C and HEED technique, PRML technique get efficiency of average 6.4% in energy consuming respect of cluster head, efficiency of average 8% in entire energy consuming respect, and more efficiency of average 7.5% in other energy consuming distribution of network scalability than LEACH-C and HEED technique.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.509-524
• /
• 2005

Due to the strict requirements of emerging applications, per-flow admission control is gaining increasing importance. One way to implement per-flow admission control is using an on­path resource reservation protocol, where the admission decision is made hop-by-hop after a new flow request arrives at the network boundary. The next-steps in signaling (NSIS) working group of the Internet engineering task force (IETF) is standardising such an on-path signaling protocol. One of the reservation methods considered by NSIS is reduced-state mode, which, suiting the differentiated service (DiffServ) concept, only allows per-class states in interior nodes of a domain. Although there are clear benefits of not dealing with per-flow states in interior nodes-like scalability and low complexity-, without per-flow states the handling of re-routed flows, e.g., after a failure, is a demanding and highly non-trivial task. To be applied in carrier-grade networks, the protocol needs to be resilient in this situation. In this article, we will explain the consequences of a route failover to resource reservation protocols: Severe congestion and incorrect admission decisions due to outdated reservation states. We will set requirements that handling solutions need to fulfill, and we propose extensions to reduced-state protocols accordingly. We show with a set of simulated scenarios that with the given solutions reduced-state protocols can handle re-routed flows practically as fast and robust as stateful protocols.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.351-365
• /
• 2020

Directional sensor networks (DSNs) can significantly improve the performance of a network by employing energy efficient communication protocols. Neighbor discovery is a vital part of medium access control (MAC) and routing protocol, which influences the establishment of communication between neighboring nodes. Neighbor discovery is a challenging task in DSNs due to the limited coverage provided by directional antennas. Furthermore, in these networks, communication can only take place when the beams of the directional antennas are pointed toward each other. In this article, we propose a novel multiple token-based neighbor discovery (MuND) protocol, in which multiple tokens are transmitted based on an area exploration algorithm. The performance of the protocol is evaluated using the Cooja simulator. The simulation results reveal that the proposed MuND protocol achieves lower neighbor discovery latency, with a 100% neighbor discovery ratio, and has a relatively low communication overhead and low energy consumption.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.329-342
• /
• 2008

The Sensor Networks have limitations in utilizing energies, developing energy-efficient routing protocol and secure routing protocol are important issues in Sensor Network. In the field of data management, Tributaries and Deltas(TD) which incorporates tree topology and multi-path topology effectively have been suggested to provide efficiency and robustness in data aggregation. And our research rendered hierarchical property to TD and proposed Clustering-based Tributaries-Deltas. Through this new structure, we integrated efficiency and robustness of TD structure and advantages of hierarchical Sensor Network. Clustering-based Tributaries-Deltas was proven to perform better than TD in two situations through our research. The first is when a Base Station (BS) notices received information as wrong and requests the network's sensing data retransmission and aggregation. And the second is when the BS is mobile agent with mobility. In addition, we proposed key establishment mechanism proper for the newly proposed structure which resulted in new Sensor Network structure with improved security and energy efficiency as well. We demonstrated that the new mechanism is more energy-efficient than previous one by analyzing consumed amount of energy, and realized the mechanism on TmoteSKY sensor board using TinyOS 2.0. Through this we proved that the new mechanism could be actually utilized in network design.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.305-308
• /
• 2009

무선 센서 네트워크 환경에서는 수많은 노드들이 광범위한 영역에 걸쳐 이벤트 정보를 전송한다. 센서들이 이벤트 정보를 정확하고 빠르게 전송하기 위하여 가능한 경로를 탐색하는 라우팅 프로토콜이 반드시 필요하다. 온도와 같은 주변 환경의 급격한 변화를 잘 탐지하도록 설계된 클러스터 기반 계층적 라우팅 프로토콜인 TEEN(Threshold sensitive Energy Efficient sensor Network protocol)을 채택하여 분석하고 단점을 개선하고자 하였다. 따라서 새로운 개념인 SRS(Self Rescue Signal)를 TEEN 프로세스에 적용하여 이벤트 발생 정보를 알 수 없다는 점을 개선하기 위한 방법을 연구하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.213-217
• /
• 2003

An Ad-Hoc networks is a set of wireless mobile host which forms temporary networks without any concentrated controls or any helps of standard support services. Mobile host' routers are operated by their mobile hosts without fixed routers, therefore, the original routing protocol algorithm are not effective. There are two major Protocols in Ad-Hoc Network. A Table-Driven algorithm and an On-Demand, but the latter is presented more effective. We try to compare and analyze the performances of each protocol's host in this thesis.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.26-35
• /
• 1997

In this paper, a VHDL implementation method for the internet protocol (IP) placed on top of ATM, so called IP over ATM, is presented. The proposed implementation method employs a parallel processing architecture to reduce the processing time and offers 155.52Mbps (STM-1) interface with the full-duplex mode for the ATM-based network. Furthermore, in order to minimize the search time for the table look-up, a LANCAM-based structure combining the routing table with the ATMARP table is proposed. The VHDL simulation results show that this proposed method can transmit (receive) at 155.52Mbps with delays of 48.5 clocks (29.5clocks).

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.5
• /
• pp.251-259
• /
• 2020

Ad hoc On-demand Distance Vector (AODV) protocol and its variants employ two important timers, hello and hold timer to keep track of topology changes. Moreover, hold timer is computed by multiplying constant value to hello timer. But, this configuration leads to inaccurate settings of hold timer. To solve this problem, in this paper, we propose a new dynamic adjustment of hello and hold timer scheme by removing dependency between them. A new metric to measure mobility is applied into hello timer, while expected link lifetime does holder timer. Simulation results show a significant reduction in the number of messages, a fact suggesting that it is possible to maintain and in some cases improve the performance of AODV with a minimum amount of messages released into the network.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.5-9
• /
• 2005

One of the imminent problems to be solved within wireless sensor network is to balance out energy dissipation among deployed sensor nodes. In this paper, we present a transmission relay method of communications between BS (Base Station) and CHs (Cluster Heads) for balancing the energy consumption and extending the average lifetime of sensor nodes by the fuzzy logic application. The proposed method is designed based on LEACH protocol. The area deployed by sensor nodes is divided into two groups based on distance from BS to the nodes. RCH (Relay Cluster Head) relays transmissions from CH to BS if the CH is in the area far away from BS in order to reduce the energy consumption. RCH decides whether to relay the transmissions based on the threshold distance value that is obtained as a output of fuzzy logic system. Our simulation result shows that the application of fuzzy logic Provides the better balancing of energy depletion and Prolonged lifetime of the nodes.

• Annual Conference of KIPS
• /
• 2003.11c
• /
• pp.2017-2020
• /
• 2003

오늘날의 무선 이동 통신의 발전은 상당한 발전을 이루고 있다. 이동 통신 분야의 한 분야가 Ad hoc 네트워크 분야일 것이다. Ad hoc 네트워크는 기존의 고정된 네트워크의 한계를 뛰어 넘는 네트워크이다. 본 논문에서는 Ad hoc 네트워크의 클러스터 기반에서의 인증에 대한 보안 프로토콜을 연구하였다. 클러스터 기반의 CBRP(Cluster Based Routing Protocol) 라우팅 프로토콜을 이용하여 클러스터끼리의 인증을 위한 CH(Cluster Head)에 대한 선출 과정에 대한 방법과 클러스터간의 인증을 위하여 CH(Cluster Head)간의 인증을 위한 방법을 제안하였다. 기존의 방법은 CH간의 신뢰성을 전제로 하여 작성하였다. 본 논문에서도 신뢰성을 위하여 MCH(Main Cluster Head)를 두어 CH간의 신뢰성을 보장함으로써 상호 클러스터간의 인증을 위한 프로토콜을 설계하였다. MCH에서의 CH에 대한 인증 프로토콜을 설계함으로써 클러스터간의 인증의 신뢰성을 높일 수 있다.