• Title/Summary/Keyword: cluster reconfiguration

Search Result 19, Processing Time 0.02 seconds

Cluster Reconfiguration Protocol in Anonymous Cluster-Based MANETs (익명성을 보장하는 클러스터 기반 이동 애드혹 네트워크에서의 클러스터 갱신 프로토콜)

  • Park, YoHan;Park, YoungHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.103-109
    • /
    • 2013
  • Mobile ad hoc networks (MANETs) are infrastructure-less and stand-alone wireless networks with dynamic topologies. To support user's safety in MANETs, fundamental and various security services should be supported. Especially in mobile commercial market, one of the major concerns regarding security is user privacy. Recently, researches about security system to protect user privacy in cluster-based MANETs have been introduced. This paper propose a cluster reconfiguration protocol under anonymous cluster-based MANETs to enhance the network stability. The improved anonymous cluster-based MANETs can recover the network structure against abnormal states of clutserheads.

Dynamic Head Election Method For Energy-Efficient Cluster Reconfiguration In Wireless Sensor Networks (무선 센서망에서 에너지 효율적인 클러스터 재구성을 위한 동적 헤드 선출 방법)

  • Jo Yong-hyun;Lee Hyang-tack;Roh Byeong-hee;Yoo S.W.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11A
    • /
    • pp.1064-1072
    • /
    • 2005
  • For the efficient operation of sensor networks, it is very important to design sensor networks for sensors to utilize their energies in very effective ways. Cluster-based routing schemes such as LEACH can achieve their energy efficiencies by delivering data between cluster heads and sensor nodes. In those cluster-based schemes, cluster reconfiguration algorithm is one of the most critical issues to achieve longer operation lifetime of sensor networks. In this paper, we propose a new energy efficient cluster reconfiguration algorithm. Proposed method does not require any location or energy information of sensors, and can configure clusters with fair cluster regions such that all the sensors in a sensor network can utilize their energies equally. The performances of the proposed scheme have been compared with LEACH and LEACH-C.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems (배전계통 최적 재구성 문제에 PC 클러스터 시스템을 이용한 병렬 유전 알고리즘-타부 탐색법 구현)

  • Mun Kyeong-Jun;Song Myoung-Kee;Kim Hyung-Su;Kim Chul-Hong;Park June Ho;Lee Hwa-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.556-564
    • /
    • 2004
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search(GA-TS) algorithm to search an optimal solution of a reconfiguration in distribution system. The aim of the reconfiguration of distribution systems is to determine switch position to be opened for loss minimization in the radial distribution systems, which is a discrete optimization problem. This problem has many constraints and very difficult to solve the optimal switch position because it has many local minima. This paper develops parallel GA-TS algorithm for reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10% of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node aster predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium Ⅳ CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution systems in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution qualify. speedup. efficiency and computation time.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June-Ho
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.116-124
    • /
    • 2005
  • This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

Distribution System Reconfiguration Using the PC Cluster based Parallel Adaptive Evolutionary Algorithm

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho;Hwang Gi-Hyun;Yoon Yoo-Soo
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.269-279
    • /
    • 2005
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

Virtual Topology Reconfiguration Algorithm for Implementing the WDM-based Cluster (WDM-기반의 클러스터 구현을 위한 가상 토폴로지 재구성 알고리즘)

  • Park Byoung-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.9
    • /
    • pp.9-18
    • /
    • 2006
  • We completed a new cluster system based on WDM by proposing a virtual topology reconfiguration schemes. The key idea of the proposed scheme is to construct a set with the longest chains of requests of connecting nodes which need to be assigned a wavelength. All the sets have no common factor, that is, there is no duplicated link among the requests of connecting. After making the set satisfying this condition, we could assign a wavelength to per corresponding set. We could reconfigure a virtual topology with this scheme collectively. we compared our scheme to existing approaches by the OWns simulation tool. As the results, we gained improved performances, reducing 10% of blocking rate and improving 30% of ADM utilization in terms of the blocking probability and the ADM utilization.

  • PDF

MDP-Based Stepwise Network Reconfiguration Scheme for Dynamic WDM Network (동적 WDM네트워크를 위한 MDP기반의 단계적 망 재구성 기법)

  • Park, Byoung-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.160-168
    • /
    • 2008
  • We completed a new cluster system based on WDM by proposing virtual topology reconfiguration schemes. The key idea of the proposed scheme Is to construct a set with the longest chains of requests of connecting nodes which need to be assigned a wavelength. All the sets have no common factor, that is, there is no duplicated link among the requests of connecting. After making the set satisfying this condition, we could assign a wavelength to per corresponding set. We could reconfigure a virtual topology with this scheme collectively. we compared our scheme to existing approaches by the OWns simulation tool. As the results, we gained improved performances, reducing 10% of blocking rate and improving 30% of ADM utilization in terms of the blocking probability and the ADM utilization.

Reconfiguration and Capacitor Control in Distribution System Using PC Cluster System (PC Clustering을 이용한 배전계통 선로재구성 및 커패시터 설치 방안)

  • Song, Myoung-Kee;Mun, Kyeong-Jun;Kim, Hyung-Su;Park, June-Ho;Lee, Hwa-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2003.11a
    • /
    • pp.113-115
    • /
    • 2003
  • 본 논문에서는 확률적인 전역 최적해 탐색 방식인 유전알고리즘과 경험적인 최적화 알고리즘인 Tabu 탐색법을 이용하여 실시간으로 적용 가능한 배전계통 선로 재구성 및 커패시터 용량결정 방안을 제안하고자 한다. 제안한 알고리즘은 PC Cluster System으로 병렬처리하여 배전계통의 손실 최소화를 위한 선로 재구성 및 커패시터 용량 결정문제의 최적해 탐색에 소요되는 계산시간을 단축하고, 실시간 지원시스템의 성능 개선을 도모하고자 한다. PC Cluster System은 이용자의 편의를 위해서 MS Windows 환경에서 구축하였고, Visual C++ 환경에서 개발하였다. 제안한 방법의 유용성을 입증하기 위해 참고 문헌의 예제 계통에 적용한 후 종래의 방법과 비교함으로써 제안한 방법이 해의 탐색속도 및 해의 성능면에서 우수함을 입증하였다.

  • PDF

Data Transfer Method Using Relay Node in Hierarchical Mobile Wireless Sensor Network (계층구조 모바일 무선 센서 네트워크에서 중계 노드를 이용한 데이터전송 기법)

  • Kim, Yong;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.894-896
    • /
    • 2010
  • In mobile wireless sensor network, Whole nodes can move. In mobile wireless sensor network based on clustering, there can be frequent re-configuration of cluster according to frequent changes of location. Frequent reconfiguration of the cluster cause a lot of power consumption and data loss. To solve this problem, we suggest relay method for sending reliable data and decreases a number of re-configuration of cluster using relay node.

  • PDF

Distributed Authentication Model using Multi-Level Cluster for Wireless Sensor Networks (무선센서네트워크를 위한 다중계층 클러스터 기반의 분산형 인증모델)

  • Shin, Jong-Whoi;Yoo, Dong-Young;Kim, Seog-Gyu
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.95-105
    • /
    • 2008
  • In this paper, we propose the DAMMC(Distributed Authentication Model using Multi-level Cluster) for wireless sensor networks. The proposed model is that one cluster header in m-layer has a role of CA(Certificate Authority) but it just authenticates sensor nodes in lower layer for providing an efficient authentication without authenticating overhead among clusters. In here, the m-layer for authentication can be properly predefined by user in consideration of various network environments. And also, the DAMMC uses certificates based on the threshold cryptography scheme for more reliable configuration of WSN. Experimental results show that the cost of generation and reconfiguration certification are decreased but the security performance are increased compared to the existing method.

  • PDF