• Title/Summary/Keyword: node weight

Search Result 391, Processing Time 0.027 seconds

Detection and Management of Misbehaving Node in Tactical Ad-Hoc Networks (전술 Ad-hoc 네트워크에서의 비정상행위 노드 탐지 및 관리)

  • Jang, Beom-Geun;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.3
    • /
    • pp.333-343
    • /
    • 2009
  • Tactical Information Communication Network(TICN) is a concept-type integrated Military Communication system that enables precise command control and decision making by unifying the diversified military communication network and conveying diverse range of battle field information on real-time, at right place at right time. TICN is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network is consist of mobile nodes and nodes in the network depends on the cooperation of other nodes for forwarding of packets. In this context, some non-cooperating nodes may delay forwarding of packets or drop the packets. This may hamper the network as a whole and disrupt communication between the cooperating nodes. To solve this problem, we present a solution with a Node Weight Management Server(NWMS), which manages each node's weight according to its behavior in local area. When the NWMS detects misbehaving node, it increases the node's weight. If the node's weight exceeds a predefined threshold then the NWMS broadcasts the node's information into network to isolate the misbehaving node from the network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

An Efficient Detection and Management Technique of Misbehavior nodes in Ad-hoc Networks (Ad-hoc 네트워크에서의 효율적인 비정상행위 노드 탐지 및 관리 기법)

  • Lee, Yun-Ho;Lee, Soo-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.5
    • /
    • pp.71-80
    • /
    • 2009
  • Ad-hoc network consists f mobile nodes, which they are together in the communication. However, if some misbehaving nodes are in network, it is faced to many threats. Therefore, detection and management of misbehaving node are necessary to make confident in Ad-hoc networks. To solve this problem, we use Node Weight Management Server(NWMS), which it manage each node's weight in local area. When NWMS detect misbehaving node, it adds the node's weight and if the node's weight exceeds threshold then NWMS broadcasts the node's information to isolate in network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

Visual Servoing of Robot Manipulators using Pruned Recurrent Neural Networks (저차원화된 리커런트 뉴럴 네트워크를 이용한 비주얼 서보잉)

  • 김대준;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.259-262
    • /
    • 1997
  • This paper presents a visual servoing of RV-M2 robot manipulators to track and grasp moving object, using pruned dynamic recurrent neural networks(DRNN). The object is stationary in the robot work space and the robot is tracking and grasping the object by using CCD camera mounted on the end-effector. In order to optimize the structure of DRNN, we decide the node whether delete or add, by mutation probability, first in case of delete node, the node which have minimum sum of input weight is actually deleted, and then in case of add node, the weight is connected according to the number of case which added node can reach the other nodes. Using evolutionary programming(EP) that search the struture and weight of the DRNN, and evolution strategies(ES) which train the weight of neuron, we pruned the net structure of DRNN. We applied the DRNN to the Visual Servoing of a robot manipulators to control position and orientation of end-effector, and the validity and effectiveness of the pro osed control scheme will be verified by computer simulations.

  • PDF

Growth Properties of Central and Peripheral Ramets in a Zoysia sinica's Clone

  • Min, Byeong-Mee
    • Journal of Ecology and Environment
    • /
    • v.29 no.2
    • /
    • pp.105-111
    • /
    • 2006
  • A natural, tidal-flat clone of Zoysia sinica was studied to compare ramet growth properties in central area with in peripheral area. In new stolon and rhizome, internode length, weight, shoot height and weight, and spike production were monitored on July 25, 2004. The weight/height rate of shoot between stolon and rhizome, the shoot/stolon (or rhizome) rate in weight between central and peripheral area were not different. However, other properties differed in stolon from rhizome or between central and peripheral area significantly differed: 1. The rhizome in central area had a larger node number, shorter internode length, higher shoot height, larger shoot biomass, and higher rate of non-shoot nodes than that in peripheral area. 2. The stolon in central area had a smaller node number, shorter internode length, and smaller biomass than that in peripheral area. 3. In the same area, the rhizome had a larger node number (except for central area), shorter internode, higher shoot height, larger shoot biomass, higher rate of non-shoot node, and higher rate of node having over two shoots than the stolon. No relationship could be found between shoot size and spike production in shoot on vertical rhizome (lower node of old shoot).

Bit-level Array Structure Representation of Weight and Optimization Method to Design Pre-Trained Neural Network (학습된 신경망 설계를 위한 가중치의 비트-레벨 어레이 구조 표현과 최적화 방법)

  • Lim, Guk-Chan;Kwak, Woo-Young;Lee, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.9
    • /
    • pp.37-44
    • /
    • 2002
  • This paper proposes efficient digital hardware design method by using fixed weight of pre-trained neural network. For this, arithmetic operations of PEs(Processing Elements) are represented with matrix-vector multiplication. The relationship of fixed weight and input data present bit-level array structure architecture which is consisted operation node. To minimize the operation node, this paper proposes node elimination method and setting common node depend on bit pattern of weight. The result of FPGA simulation shows the efficiency on hardware cost and operation speed with full precision. And proposed design method makes possibility that many PEs are implemented to on-chip.

Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks

  • Meghanathan, Natarajan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.6
    • /
    • pp.612-627
    • /
    • 2009
  • The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

Evaluation of Skin Sensitization Potential of Skin Whitening Agents by Local Lymph Node Assay (국소 림프절 시험법(Local lymph node assay)을 이용한 피부미백화장품 원료의 피부감작성 연구)

  • 이종권;박승희;박재현;김형수;엄준호;남기택;한범석;장동덕;최광식
    • Toxicological Research
    • /
    • v.19 no.4
    • /
    • pp.285-291
    • /
    • 2003
  • The use of skin whitening agents has been recently increased in various kinds of cosmetic products, although there were some reports that whitening agents might cause allergic contact dermatitis. A murine local lymph node assay (LLNA) has been developed as an alternative to guinea pigs for contact sensitization potential. This study was carried out to investigate the skin sensitization potential of three whitening agents, arbutin, azelaic acid, and kojic acid, by LLNA using a non-radiois-topic endpoint. Female Balb/c mice were exposed topically to a weak allergen, $\alpha$-hexylcinnamalde-hyde (HCA), and three whitening agents following LLNA protocol. Lymph node (LN) weight and cell proliferation in ears and auricular lymph node using bromodeoxyuridine (BrdU) immunohistochemistry were evaluated. LN weights were significantly increased at the HCA group compared to the vehicle control. A weak allergen, HCA elicited 3-fold or greater increase in cell proliferation of lymph nodes as well as increase in cell proliferation of ear as measured by BrdU immunohistochemistry. However, in the case of skin whitening agent groups, there were no significant changes in LN weight and cell proliferation in the ear and lymph node of mice treated with 5, 10 and 20% of three whitening agents compared to the vehicle control. These results show that these three skin whitening agents may not have contact sensitization potentials at tested concentrations in Balb/c mice by LLNA.

Selection of Input Nodes in Artificial Neural Network for Bankruptcy Prediction by Link Weight Analysis Approach (연결강도분석접근법에 의한 부도예측용 인공신경망 모형의 입력노드 선정에 관한 연구)

  • 이응규;손동우
    • Journal of Intelligence and Information Systems
    • /
    • v.7 no.2
    • /
    • pp.19-33
    • /
    • 2001
  • Link weight analysis approach is suggested as a heuristic for selection of input nodes in artificial neural network for bankruptcy prediction. That is to analyze each input node\\\\`s link weight-absolute value of link weight between an input node and a hidden node in a well-trained neural network model. Prediction accuracy of three methods in this approach, -weak-linked-neurons elimination method, strong-linked-neurons selection method and integrated link weight model-is compared with that of decision tree and multivariate discrimination analysis. In result, the methods suggested in this study show higher accuracy than decision tree and multivariate discrimination analysis. Especially an integrated model has much higher accuracy than any individual models.

  • PDF

Routing Protocol based on Connectivity Degree and Energy Weight (연결도와 에너지 가중치 기반의 라우팅 프로토콜)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.7-15
    • /
    • 2014
  • In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

  • PDF

Modeling and Simulation of Social Network using Correlation between Node and Node Weight (노드 간 연관성과 노드 가중치를 이용한 소셜 네트워크 모델링 및 시뮬레이션)

  • Cho, Min-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.10
    • /
    • pp.949-954
    • /
    • 2016
  • The usage of Social Network in business environment is now processing various methods. The purpose of this paper is doing a simulation about how each node of social network reacts to a special input, and how a specific node have an effect to other nodes. Also, when we change weight of node in the same input, we can trace about change of node status in real time. So, we can use this model for identification of important person in social network, and we can use it for checking the reaction of person in specific input. we use VENSIM program for modeling and simulation process.