• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• International Journal of Computer Science & Network Security
• /
• 제21권6호
• /
• pp.89-100
• /
• 2021

Smart Grid Network (SGN) is a next generation electrical power network which digitizes the power distribution grid and achieves smart, efficient, safe and secure operations of the electricity. The backbone of the SGN is information communication technology that enables the SGN to get full control of network station monitoring and analysis. In any network where communication is involved security is essential. It has been observed from several recent incidents that an adversary causes an interruption to the operation of the networks which lead to the electricity theft. In order to reduce the number of electricity theft cases, companies need to develop preventive and protective methods to minimize the losses from this issue. In this paper, we have introduced a machine learning based SVM method that detects malicious nodes in a smart grid network. The algorithm collects data (electricity consumption/electric bill) from the nodes and compares it with previously obtained data. Support Vector Machine (SVM) classifies nodes into Normal or malicious nodes giving the statues of 1 for normal nodes and status of -1 for malicious -abnormal-nodes. Once the malicious nodes have been detected, we have done a trust evaluation based on the nodes history and recorded data. In the simulation, we have observed that our detection rate is almost 98% where the false alarm rate is only 2%. Moreover, a Trust value of 50 was achieved. As a future work, countermeasures based on the trust value will be developed to solve the problem remotely.

• 대한수의학회지
• /
• 제41권3호
• /
• pp.281-285
• /
• 2001

This study was performed to investigate the gross anatomical features and microscopical structures of the hemal nodes and the hemolymph nodes in the sheep. The hemal nodes and hemolymph nodes were observed mainly in periphery of the thoracic and abdominal aortae of the animals. The size of hemal nodes was generally smaller than that of the hemolymph nodes, and the shape of the both organs was spherical or ovoid. The color of the hemal nodes was red, while that of the hemolymph nodes was grary with red bands. The hemal nodes were surrounded by a relatively thick connective tissue capsule and there were extensive subcapsular sinuses distended by a great number of erythrocytes. Although a few number of lymphatic nodules and small areas of diffuse lymphatic tissues were observed in the parenchyma, no typical cortex and medulla were defined in the hemal node. Small numbers of blood vessels were found at the connective tissue capsule but lymph vessel was not observed microscopically in this organ. The hemolymph nodes were covered by a relatively thick connective tissue capsule and there was a hilus in each node. The parenchyma was divided into cortex and medulla. The cortex was composed of a few numbers of lymphatic nodules and some diffuse lymphatic tissues. The medulla comprised medullary sinuses and cords. Afferent and efferent lymph vessels were observed at the periphery of the capsule adn the hilus, respectively. The subcapsular and medullary sinuses were not extensive but filled with small numbers of erythrocytes. The stroma of hemal node and hemolymph node was composed of reticular cells and fibers, and the capsule and trabecula consisted of collagenous fibers with smooth muscle fibers.

• ETRI Journal
• /
• 제42권6호
• /
• pp.872-885
• /
• 2020

Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2977-2979
• /
• 2000

A Fuzzy Hybrid-Multilayer Perceptron (FH-MLP) Structure is proposed in this paper. proposed FH-MLP is not a fixed architecture. that is to say. the number of layers and the number of nodes in each layer of FH-MLP can be generated to adapt to the changing environment. FH-MLP consists of two parts. one is fuzzy nodes which each node is operated as a small fuzzy system with fuzzy implication rules. and its fuzzy system operates with Gaussian or Triangular membership functions in premise part and constants or regression polynomial equation in consequence part. the other is polynomial nodes which several types of high-order polynomial such as linear. quadratic. and cubic form are used and is connected as various kinds of multi-variable inputs. To demonstrate the effectiveness of the proposed method. time series data for gas furnace process has been applied.

• 한국정보통신학회논문지
• /
• 제7권6호
• /
• pp.1161-1167
• /
• 2003

Ad hoc 네트워크상 노드들은 정보전송과 위치등록, 노드간의 라우팅경로 유지를 위해 많은 패킷전송이 이루어진다. 이러한 환경에서의 트래픽은 고정망에서 보다 이동성 변수에 따라 더욱 많은 수가 발생하게 될 것이다. 본 논문에서는 무선 ad-hoc 다중홉에서의 트래픽제어를 위한 클러스터링 알고리즘을 통해 패킷 전송효율을 분석한다.

• International Journal of Computer Science & Network Security
• /
• 제21권3호
• /
• pp.165-171
• /
• 2021

Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

• 한국정보통신학회논문지
• /
• 제9권1호
• /
• pp.58-64
• /
• 2005

본 논문은 Ad-hoc 네트워크에서의 전송을 효율적으로 하기 위한 클러스터링 알고리즘에 대해 실험을 통하여 살펴보았다. Ad-hoc 네트워크상 노드들은 정보전송과 위치등록, 노드간의 라우팅 경로 유지를 위해 많은 패킷전송이 이루어진다. 이러한 환경에서의 트래픽은 고정망에서 보다 이동성 변수에 따라 더욱 많은 수가 발생하게 될 것이다. 본 논문에서는 무선 Ad-hoc 다중 홉에서의 트래픽 제어를 위한 클러스터링 알고리즘을 통해 패킷 전송효율을 분석하여 그 결과를 제시한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.653-655
• /
• 2015

본 논문은 Ad-hoc 네트워크에서의 전송을 효율적으로 하기 위한 클러스터링 알고리즘에 대해 실험을 통하여 살펴보았다. Ad-hoc 네트워크상 노드들은 정보전송과 위치등록, 노드간의 라우팅 경로유지를 위해 많은 패킷전송이 이루어진다. 본 논문에서는 무선 Ad-hoc 통신망에서 요구되는 알고리즘 프로그램개발을 통하여 패킷 전송효율을 분석을 통해 문자메세지, 무료통화가 가능한 알고리즘을 개발하여 향후 통신 서비스 산업에 적용가능함을 제시한다.

• 한국국방경영분석학회지
• /
• 제17권2호
• /
• pp.113-122
• /
• 1991

This paper presents the Allocation Priority Scheme (APS) for multiprocessor system. The objective of APS is to reduce the time-complexity on a Physical Mapping Scheme(PMS). The PMS is to allocate the nodes of the Data Dependency Graph (DDG) to the multprocessors efficiently and effectively. The APS provides the priority to each node (vertex) in the DDG. In other words, the goal of the APS is to find a request resource mapping such that the total cost (time-complexity) is minimized. The special case in which all requests have equal priorities and all resoruces have equal precedences, and the comparisons between our APS and other schems are discussed in the paper. The APS provides the heuristic rules which are based on maximum height (MH), number of children nodes ($N_c$), number of father nodes ($N_f$), and computation time ($T_c$). The estimation moth of the computaion time is in the paper.