• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.213-224
• /
• 2003

The proposed algorithm can always set up the optimal threshold value regardless of channel characteristics using an adaptive threshold establishment method that determines the threshold level according to channel noise power, and then it uses the specially designed training symbols that can make the algorithm's estimation performance be less sensitive to power delay profile variation in a multipath channel. In result, the estimation performance of the proposed technique is less affected by channel characteristic variation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.23-32
• /
• 2005

This paper proposes a new algorithm for the energy constraint ad-hoc network which efficiently spread the energy usage over the network through the backup route scheme in order to increase the network lifetime. Recently, the various energy-efficient routing algorithms based on On-demanding method are proposed. Among them, PSR(Power-aware Source Routing) increased the network lifetime through the periodical route alternation depended on the use of the battery while DSR(Dynamice Source Routing) uses only the route selected during the route discovery phase. But PSR has a problem that it increases the route overhead because of the frequent flooding for the route alternation. For solving this problem, we propose HPSR(Hierarchical Power-aware Source Routing) which uses the backup route set during the route discovery in order to alternation the route without the flooding. HPSR increases the network lifetime due to the frequent route alternation using backup route while it decreases the routing overhead due to the reduced flooding. In this paper, we also prove the performance of HPSR through the simulation using OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.581-590
• /
• 2003

This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.231-236
• /
• 2011

In recent years, LBS(Location Based Service) is applied in many different fields. Therefore, various location-aware schemes have been studied. In the location awareness system using time dependent algorithm, TOA(Time of Arrival) or TDOA(Time Difference of Arrival) algorithm, distortion of a signal by AWGN(Additive White Gaussian Noise) and multi-path effects cause the degradation of location awareness performance. In this paper, the unexpected noise is eliminated by averaging multiple pulses in order to overcome the degradation of performance. Also, we research the technique for improving the performance of the location awareness by detecting direct-path signal with adjusting threshold.

• The Journal of the Korea Contents Association
• /
• v.13 no.1
• /
• pp.30-39
• /
• 2013

In recent years, with the development of devices to collect multimedia data such as small CMOS camera sensor and micro phone, studies on wireless multimedia sensor network technologies and their applications that extend the existing wireless sensor network technologies have been actively done. In such applications, various basic schemes such as the processing, storage, and transmission of multimedia data are required. Especially, a security for real world environments is essential. In this paper, in order to defend the sniffing attack in various hacking techniques, we propose a multipath routing scheme for physically avoiding the data transmission path from the risk factors. Our proposed scheme establishes the DEFCON of the sensor nodes that are geographically close to risk factors and the priorities according to the importance of the data. Our proposed scheme performs risk factor detour multipath routing through a safe path considering the DEFCON and data priority. Our experimental results show that although our proposed scheme takes the transmission delay time by about 5% over the existing scheme, it reduces the eavesdropping rate that can attack and intercept data by the risk factor by about 18%.

• Journal of Korea Multimedia Society
• /
• v.17 no.2
• /
• pp.191-199
• /
• 2014

The unicasting routing technology of VANET is very important for user convenience. Unicasting packets must be forwarded to the appropriate path in order to arrive to the destination. However, there are so many problems because the vehicle nodes have limited information related to the routing decision. In particular, packet delivery failure will be occurred by selecting the path already failed again. We call this problem as 'Failed Path Re-Selection Problem'. In this paper, we propose an enhanced rerouting function of VANET Routing. The proposed rerouting function uses the failed path information when rerouting function executed. For this rerouting function, failed path information will be stored in the packet whenever the routing fail occurred. By the comparison with the performance of legacy VANET routing function, the superiority of the proposed method can be seen.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.31-40
• /
• 2009

What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.313-315
• /
• 2005

본 논문은 이동 애드혹 네트워크에서 이동 에이전트를 이용하여 동적으로 클러스터링을 구성하는 기법에 관한 것이다. 기존에 제안된 이동 애드혹 네트워크에서의 클러스터링 기법은 클러스터의 크기가 고정되어 있기 때문에 네트워크의 상태나 노드들의 이동성에 따라 클러스터 재구성의 오버헤드가 발생하였다. 본 제안 기법에서는 네트워크의 상태에 따라 클러스터 크기의 최대 임계치와 최소 임계치를 설정하고 이에 따라 이동 에이전트를 이용하여 클러스터를 병합 흑은 분할하면서 클러스터의 크기를 임계치 내에서 일정하게 유지시킴으로써, 클러스터 재구성의 오버헤드라 클러스터 내부의 경로 탐색의 오버헤드를 줄일 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.298-300
• /
• 2006

Ad-hoc 지오캐스팅 프로토콜 목적은 특별한 지오캐스팅영역(Geocasting region)에 위치한 노드들의 그룹에 패킷데이터(Geo-packet)를 전송하는 것이다. 본 논문에서는 Ad-hoc 기반의 이동네트워크 환경에서 지오캐스트 서비스를 지원하는 기존 연구의 데이터 전송경로의 비 최적화, 빈번한 지오캐스트 전송 트리의 재구성으로 인한 오버헤드(Overhead), 서비스 단절의 문제를 해결하기 위해 이동 형태 기반의 가변 지오캐스팅 기법을 제안한다. 가변 지오캐스팅 기법은 서비스 범위를 목적지 노드의 이동성(Mobility)에 따라 가변적으로 설정하고 자원예약 기법과 다양한 실험을 통해 본 논문에서 제안된 지오캐스트 기법을 성능 평가하였다.