• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권7호
• /
• pp.1817-1839
• /
• 2024

To solve the problem of insufficient recognition of key nodes in the existing software defect detection process, this paper proposes a key node recognition algorithm based on node expansion degree and improved K-shell position, shortened as SDD_KNR. Firstly, the calculation formula of node expansion degree is designed to improve the degree that can measure the local defect propagation capability of nodes in the software network. Secondly, the concept of improved K-shell position of node is proposed to obtain the improved K-shell position of each node. Finally, the measurement of node defect propagation capability is defined, and the key node recognition algorithm is designed to identify the key function nodes with large defect impact range in the process of software defect detection. Using real software systems such as Nano, Cflow and Tar to design three sets of experiments. The corresponding directed weighted software function invoke networks are built to simulate intentional attack and defect source infection. The proposed SDD_KNR algorithm is compared with the BC algorithm, K-shell algorithm, KNMWSG algorithm and NMNC algorithm. The changing trend of network efficiency and the strength of node propagation force are analyzed to verify the effectiveness of the proposed SDD_KNR algorithm.

• 한국통신학회논문지
• /
• 제37B권10호
• /
• pp.889-900
• /
• 2012

무선 센서 네트워크에서 수신 신호 세기를 이용한 위치추정 방식은 다수의 저전력 노드로 구성된 센서네트워크에 적합한 방법 중의 하나로 고려되고 있다. 수신 신호 세기를 이용한 위치추정 방식의 오차를 줄이기 위해서는 적절한 경로 감쇄 지수 (path-loss exponent, PLE)의 추정이 요구된다. 기존의 위치 추정 방식은 자신의 위치를 알고 있는 각각의 앵커가 인접한 앵커들을 참조하여 PLE를 측정하고, 자신의 위치를 알고자 하는 센서 노드는 수신 신호 세기를 기반으로 가장 인접한 앵커를 판별한 후, 해당 앵커가 측정한 PLE를 자신의 위치 추정에 이용하는 방식을 취하고 있다. 이때의 PLE는 인접한 앵커의 위치에서 측정된 것이기 때문에 실제 측정한 위치에서만 높은 신뢰성을 가지며, 그 외의 위치에서는 다른 값을 갖는 경우가 일반적이다. 따라서 인접한 앵커들을 참조하여 추정한 PLE를 센서 노드의 위치 추정에 직접적으로 이용하는 것은 위치 추정 시 오차를 발생 시키는 주요 원인이 된다. 본 논문에서는 센서 노드 스스로가 각각의 인접한 앵커들에 대한 PLE를 추정하고, 이를 이용하여 센서 노드의 위치를 추정하는 기법을 다루며, 특히, 추정된 센서 노드의 위치에서 각 앵커들까지의 거리를 기반으로 PLE를 반복적으로 재추정하도록 하여 위치 추정 오차를 줄이도록 하는, 반복 PLE 추정을 통한 위치 추정 기법을 제안한다. 성능평가에서는 제안된 기법이 기존의 방법보다 위치 추정 오차를 줄일 수 있음을 보였다.

• 생물환경조절학회지
• /
• 제15권2호
• /
• pp.173-176
• /
• 2006

The relationship between source leaf position and photo-assimilate translocation and distribution was characterized for tomato (Lycopersicon esculentum Mill) grown in the greenhouse. Three different positions of source leaf on the stem (first node above or below the first fruit cluster and $5^{th}$ node above the first fruit cluster) were tested for their influence on $^{14}CO_2$ assimilation and transfer to different parts of the plant. The leaves at the $5^{th}$ node above the first fruit cluster transferred the highest (57%) proportion of $C^{14}$ to other plant parts, followed by leaves home on the first node below the first fruit cluster (50%), and the first node above the first fruit cluster (39%). In all treatments, fruits served as the strongest sink for $C^{14}$, followed by stem, leaf, and root tissues. The leaf home on the $5^{th}$ node above the first fruit cluster transferred the largest amount of $C^{14}$ to the second fruit cluster.

• 한국생물환경조절학회:학술대회논문집
• /
• 한국생물환경조절학회 2001년도 봄 학술발표논문집
• /
• pp.79-80
• /
• 2001

This study was conducted to estimate rooting and shooting in single-node cuttings (SNC) of roses 'Rote Rose' and 'Teresa' to several conditions: growth stage, node position, and leaf area of cutting, so that single-stemmed roses (SSR) could be used in rose factory system. There was no effects of growth stage of flowering shoots far cutting on the rooting and shooting of SNC in both of the two cultivars. However, the node position and leaf area of cuttings significantly affected the rooting and shooting of SNC: the speed was accelerated with larger leaf area and upper node cuttings, but the rate showed little difference as above 95%. Based on above results, rooting and shooting in SNC was forced by leaf area mainly, followed by node positions. On the other hand, flowering rate of shoots from SNC was improved mainly with larger leaf area in cuttings. Shoots of 45cm-longer, qualified for rose factory system, increased with lower node and larger leaf area significantly. Therefore, it could be said that the potential growth of shoots from SNC would be influenced mainly by leaf area, followed by node position on cutting.

• 한국컴퓨터정보학회논문지
• /
• 제23권2호
• /
• pp.35-43
• /
• 2018

In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 춘계종합학술대회
• /
• pp.364-367
• /
• 2007

실내위치인식을 위한 플랫폼으로서 RSSI(Received Signal Strength Indicator)기반으로 Zigbee/IEEE802.15.4표준을 따르는 CC2431(Chipcon, Norway)과 베이스스테이션노드를 결합하여 실내위치인식 시스템을 구현하였다. CC2431은 지정된 위치에서 자신의 현재위치를 전송해주는 레퍼런스노드와 인접해있는 레퍼런스노드들의 현재위치(X, Y좌표)와 RSSI값을 수신받아 내장된 Location Engine에서 자신의 현재위치를 계산하여 베이스스테이션노드로 전송해주는 블라인드노드로 구성이 되어있다. 베이스스테이션노드는 블라인드노드의 현재위치를 전송받아서 PC로 데이터를 넘겨주기 위한 게이트웨이로 사용하였으며 서버측의 원격지뿐만 아니라 외부에서도 블라인드노드의 현재위치를 실시간으로 확인할 수가 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• 한국정보과학회논문지:데이타베이스
• /
• 제33권5호
• /
• pp.495-512
• /
• 2006

최근 다양한 응용 분야에서 이동 객체의 현재 위치를 기반으로 미래 위치를 검색하기 위한 필요성이 증가되고 있다. 이와 함께, 대용량의 이동 객체를 빠르게 검색하기 위한 색인 구조의 필요성이 증가되고 있다. 기존에 제안된 색인 구조들은 이동 객체의 위치를 검색하는 과정에서 불필요한 노드의 확장을 유발시켜 검색 성능이 저하되는 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 객체의 이동성을 고려한 공간 분할 방식의 색인 구조를 제안한다. 제안하는 색인 구조는 노드의 오버플로우를 처리하기 위해 형제 노드와 병합 분할을 수행하고 형제 노드와 병합을 수행하여 오버플로우를 처리할 수 없을 경우에는 이동성을 고려하여 분할을 수행한다. 제안하는 색인 구조는 분할된 영역들 사이에 겹침 영역이 발생하지 않으며 속도, 이동 객체가 노드의 영역을 벗어나는 시간, 노드의 갱신 시간과 같은 파라미터를 고려하여 분할 위치를 판별한다. 중간 노드에서는 공간 분할 방식의 색인 구조에서 발생하는 연속 분할을 방지하기 위한 분할 위치를 판별한다. 제안하는 색인 구조의 우수성을 입증하기 위해 이동 객체에 대한 검색 성능을 비교 분석한다. 성능 평가 결과 제안하는 색인 구조는 현재 위치 검색에 대해서는 $17%{\sim}264%$ 그리고 미래 위치 검색에 대해서는 $107%{\sim}19l%$ 성능 향상을 나타낸다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권8호
• /
• pp.1388-1403
• /
• 2011

A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.4971-4987
• /
• 2019

Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.