• 제목/요약/키워드: Nodes Clustering

검색결과 464건 처리시간 0.029초

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국정보통신학회 2012년도 춘계학술대회
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제17권1호
    • /
    • pp.225-232
    • /
    • 2013
  • In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

Security Design for Efficient Detection of Misbehavior Node in MANET (MANET에서 비정상 노드를 효율적으로 탐지하기 위한 보안 설계)

  • Hwang, Yoon-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제35권3B호
    • /
    • pp.408-420
    • /
    • 2010
  • On a Mobile Ad hoc NETwork(MANET), it is difficult to detect and prevent misbehaviors nodes existing between end nodes, as communication between remote nodes is made through multiple hop routes due to lack of a fixed networked structure. Therefore, to maintain MANET's performance and security, a technique to identify misbehaving middle nodes and nodes that are compromise by such nodes is required. However, previously proposed techniques assumed that nodes comprising MANET are in a friendly and cooperative relationship, and suggested only methods to identify misbehaving nodes. When these methods are applied to a larger-scale MANET, large overhead is induced. As such, this paper suggests a system model called Secure Cluster-based MANET(SecCBM) to provide secure communication between components aperANET and to ensure eed. As such, this pand managems suapemisbehavior nodes. SecCBM consists apetwo stages. The first is the preventis pstage, whereemisbehavior nodes are identified when rANET is comprised by using a cluster-based hierarchical control structure through dynamic authentication. The second is the post-preventis pstage, whereemisbehavior nodes created during the course apecommunication amongst nodes comprising the network are dh, thed by using FC and MN tables. Through this, MANET's communication safety and efficiency were improved and the proposed method was confirmed to be suitable for MANET through simulation performance evaluation.

An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks

  • Zhao, Liquan;Chen, Nan
    • Journal of Information Processing Systems
    • /
    • 제13권3호
    • /
    • pp.500-517
    • /
    • 2017
  • In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

Efficient USN Routing Protocol using Sub-Clustering

  • Jeong, Su-Hyung;Yoo, Hae-Young
    • Journal of information and communication convergence engineering
    • /
    • 제6권4호
    • /
    • pp.466-469
    • /
    • 2008
  • The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

Machine-Part Grouping Formation Using Grid Computing (그리드 컴퓨팅을 이용한 기계-부품 그룹 형성)

  • Lee, Jong-Sub;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제30권3호
    • /
    • pp.175-180
    • /
    • 2004
  • The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells using grid computing. It forms machine cells from the machine-part incidence matrix by means of Self-Organizing Maps(SOM) whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the machine vectors. It generates machine-part group which are assigned to machine cells by means of the number of bottleneck machine with processing part. The proposed algorithm was tested on well-known machine-part grouping problems. The results of this computational study demonstrate the superiority of the proposed algorithm.

An Energy and Coverage Efficient Clustering Method for Wireless Sensor Network (무선 센서 네트워크를 위한 효율적인 에너지와 커버리지 클러스터링 방법)

  • Gong, Ji;Zhang, Kai;Kim, Seung-Hae;Cho, Gi-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (A)
    • /
    • pp.261-262
    • /
    • 2008
  • Due to technological advances, the manufacturing of small and low cost of sensors becomes technically and economically feasible. In recent years, an increasing interest in using Wireless Sensor Network (WSN) in various applications, including large scale environment monitoring, battle field surveillance, security management and location tracking. In these applications, hundreds of sensor nodes are left to be unattended to report monitored data to users. Since sensor nodes are placed randomly and sometimes are deployed in underwater. It is impossible to replace batteries often when batteries run out. Therefore, reducing energy consumption is the most important design consideration for sensor networks.

  • PDF

Power Efficient Multi-hop Routing Protocol in Cluster for Wireless Sensor Networks (무선 센서네트워크 환경에서의 효율적인 전력소비를 위한 라우팅 프로토콜)

  • Bae, Dae-Jin;Kim, Jong-Tae
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • 제22권2호
    • /
    • pp.142-147
    • /
    • 2008
  • In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.

A Calculation Method of Closeness Centrality for High Density Wireless Sensor Networks

  • Dehkanov, Shuhrat;Kim, Young-Rag;Lee, Bok-Man;Kim, Chong-Gun
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 한국정보컨버전스학회 2008년도 International conference on information convergence
    • /
    • pp.43-46
    • /
    • 2008
  • Centrality has been actively studied in network analysis field. In this paper we show a calculation method of closeness centrality for WSN. Since nodes in a sensor network are very scarce in energy and computation capability the calculation of the closeness is done in two tiers by dividing network into clusters. In first step closeness centrality for cluster heads is calculated. In the second step closeness of member nodes of the chosen cluster is computed in respect to that cluster itself.

  • PDF

A Local Weight Learning Neural Network Architecture for Fast and Accurate Mapping (빠르고 정확한 변환을 위한 국부 가중치 학습 신경회로)

  • 이인숙;오세영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • 제28B권9호
    • /
    • pp.739-746
    • /
    • 1991
  • This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

  • PDF