• Title/Summary/Keyword: 선출 알고리즘

Search Result 84, Processing Time 0.026 seconds

An Adaptive Clustering Algorithm of Wireless Sensor Networks for Energy Efficiency (에너지 효율을 위한 무선센서 네트워크의 적응형 클러스터링 알고리즘)

  • Cho, Young-bok;Lee, Sang-ho;Woo, Sung-Hee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.99-106
    • /
    • 2017
  • In the WSN environment, the sensor node is selected as the cluster header and consumes a lot of energy. Therefore, we proposed a method to automatically select a cluster algorithm using the sensor field environment that can improve the reliability of the whole network by applying an energy efficient clustering algorithm based on already deployed sensor field. Experimental results show that FDN is extended about 3 times by using the proposed algorithm. In addition, the network energy is extended by up to 30% compared to the conventional method, thereby improving the reliability of the sensor network.

The energy conserving routing algorithm based on the distance for Ad-hoc (에드 혹 네트워크에서 위치정보를 이용한 에너지 효율적 라우팅 알고리즘)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.227-230
    • /
    • 2011
  • In this paper, we are proposed ECOPS(Energy Conserving optimal Path Schedule) algorithm that according to ALPS(Ad hoc network Localized Positioning System) algorithm the location information is received and the new head node is selected considering the energy efficiency. The proposed algorithm follows RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure, that is the hierarchic cluster structure. And by using the location information of the node, it maintains the cluster which the energy is efficient with the production. It increases the life time of the total routing structure.

  • PDF

A Study on Modification of Consensus Algorithm for Blockchain Utilization in Financial Industry

  • Im, Hong-Gab
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.12
    • /
    • pp.99-104
    • /
    • 2021
  • Blockchain technology is a distributed ledger technology that shares the ledger between multiple nodes connected to a distributed network. The data managed through the existing central server is managed through the blockchain, and the transparency, accuracy, and integrity of the transaction data is increased, and the need for data management through the blockchain is increasing. In this paper, recognizing the need for trust-based data sharing between trust-based institutions in the financial industry, this paper describes the process of selecting leader nodes in Raft, a private blockchain consensus algorithm, as a way to increase data management efficiency through blockchain. A modified consensus algorithm is presented. The performance of the modified consensus algorithm and the general Raft consensus algorithm presented in this paper was compared and analyzed based on the transaction processing time, and it was confirmed that the efficiency of the consensus process was increased by applying the proposed consensus algorithm.

An Efficient Cluster Management Scheme Using Wireless Power Transfer for Mobile Sink Based Solar-Powered Wireless Sensor Networks

  • Son, Youngjae;Kang, Minjae;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.105-111
    • /
    • 2020
  • In this paper, we propose a scheme that minimizes the energy imbalance problem of solar-powered wireless sensor network (SP-WSN) using both a mobile sink capable of wireless power transfer and an efficient clustering scheme (including cluster head election). The proposed scheme charges the cluster head using wireless power transfer from a mobile sink and mitigates the energy hotspot of the nodes nearby the head. SP-WSNs can continuously harvest energy, alleviating the energy constraints of battery-based WSN. However, if a fixed sink is used, the energy imbalance problem, which is energy consumption rate of nodes located near the sink is relatively increased, cannot be solved. Thus, recent research approaches the energy imbalance problem by using a mobile sink in SP-WSN. Meanwhile, with the development of wireless power transmission technology, a mobile sink may play a role of energy charging through wireless power transmission as well as data gathering in a WSN. Simulation results demonstrate that increase the amount of collected data by the sink using the proposed scheme.

Load Balancing Algorithm for Parallel Computing of Design Problem involving Multi-Disciplinary Analysis (다분야통합해석에 기반한 설계문제의 병렬처리를 위한 부하분산알고리즘)

  • Cho, Jae-Suk;Chu, Min-Sik;Song, Yong-Ho;Choi, Dong-Hoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.3
    • /
    • pp.281-286
    • /
    • 2007
  • An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of computing time for the entire design process, and therefore it is essential to introduce a Multiple Processor System (MPS) for reducing the computing time. However, when applying conventional parallel processing techniques, all of the CAE S/W requited for the MDA should be installed on all the servers making up MPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a Computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

Clustering Algorithm for Efficient Energy Consumption in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 에너지 사용을 위한 클러스터링 알고리즘)

  • Na, Sung-Won;Choi, Seung-Kwon;Lee, Tae-Woo;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.6
    • /
    • pp.49-59
    • /
    • 2014
  • Recently, wireless sensor networks(WSNs) are widely used for intrusion detection and ecology, environment, atmosphere, industry, traffic, fire monitoring. In this paper, an energy efficient clustering algorithm is proposed. The proposed algorithm forms clusters uniformly by selecting cluster head that optimally located based on receiving power. Besides, proposed algorithm can induce uniform energy consumption regardless of location of nodes by multi-hop transmission and MST formation with limited maximum depth. Through the above, proposed algorithm elongates network life time, reduces energy consumption of nodes and induces fair energy consumption compared to conventional LEACH and HEED. The results of simulation show that the proposed clustering algorithm elongates network life time through fair energy consumption.

Epidemic & Prediction based Routing Protocol for Delay Tolerant Network (DTN에서 에피데믹과 예측 기반 알고리즘을 이용한 라우팅 프로토콜)

  • Dho, Yoon-Hyung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.404-407
    • /
    • 2014
  • Delay Tolerant Network (DTN) is a networking architecture that is designed to solve network problem in unstable and stressed environments using the Store-Carry-Forward method. Different form general networks, DTN does not guarantee the end-to-end connectivity, it is hard for the exiting TCP/IP based protocols to normally work due to the characteristic such as large latency and unstable link connectivity. And the condition that send massage without the information of the destination occurs frequently. Thus, suitable routing protocols for DTN are required and being researched. In this paper, we propose a novel routing protocol for DTN utilizing epidemic and prediction based algorithm to prevent the defect of previously DTN routing protocols such as the absence of the holistic view of the network. Proposed algorithm predicted destination using the mobility information recorded in neighbor node's history and utilize epidemic based algorithm when occurred condition without destination's information. This algorithm is enhanced in terms of delivery ratio, decreases latency and overhead in sparse network such as DTN.

  • PDF

A Clustered Directed Diffusion Routing Protocol for Wireless Sensor Network (무선센서 네트워크에서 클러스터화된 디렉티드 디퓨젼 라우팅 프로토콜)

  • Zhao, Bin;Lee, Kyung-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.165-172
    • /
    • 2011
  • Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Directed Diffusion is a well known routing protocol. In this paper we adopt the clustering mechanism to improve the efficiency of Directed Diffusion. We introduce C-Directed Diffusion which make clusters, select the CH(Cluster Head) and CHs do the same process as in Directed Diffusion. C-Directed Diffusion is pretty simple and show better performance than Directed Diffusion.

Cluster Group Multicast by Weighted Clustering Algorithm in Mobile Ad-hoc Networks (이동 에드-혹 네트워크에서 조합 가중치 클러스터링 알고리즘에 의한 클러스터 그룹 멀티캐스트)

  • 박양재;이정현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.37-45
    • /
    • 2004
  • In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

A Study of Efficient Set Detour Routing using Context-Aware Matrix (MANET에서 상황인식 매트릭스를 이용한 효율적인 우회경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.517-518
    • /
    • 2013
  • 모바일 에드 혹 네트워크(Mobile Ad hoc Network)는 이동성을 가진 노드로 구성된 네트워크로서, 통신기반 시설의 지원이 없어도 스스로 통신망을 구축하여 통신한다. 하지만 노드의 이동성으로 인한 토폴로지의 변화가 빈번하여, 라우팅 경로 재설정으로 인한 오버헤드가 생성된다. 오버헤드 생성을 줄이기 위하여 클러스터링을 이용한 연구가 진행되어 왔다. 클러스터가 형성된 MANET에서 클러스터 헤드 노드가 이동함에 따라 클러스터 영역을 벗어나게 되었을 경우, 클러스터 그룹에 속하는 멤버 노드들은 패킷을 보내지 못하며, 클러스터 헤드노드를 선출하지 못하여 사용할 수 없는 노드가 된다. 본 논문에서는 클러스터 헤드 노드가 클러스터 영역을 벗어날 경우, 클러스터 멤버노드의 상황인자 속성 벡터 정보가 유사한 클러스터 헤드노드를 이웃한 주변 클러스터 헤드로부터 검색 및 선택하여, 우회경로를 제공하는 알고리즘을 제안한다. 제안된 알고리즘에서 각 노드는 상황정보 매트릭스를 가지고 있어, 전송 커버리지 영역이 2홉 이내 반경에 있는 노드의 벡터 정보를 저장하게 된다. 클러스터 헤드 노드와의 연결이 끊어 졌을 경우, 클러스터 멤버 노드는 상황정보 매트릭스를 이용하여, 벡터정보가 유사한 클러스터 헤드 노드를 선택하여, 노드 간의 연결성 및 패킷의 전달성이 향상 된다.

  • PDF