• 한국컴퓨터정보학회논문지
• /
• 제13권6호
• /
• pp.137-145
• /
• 2008

대형 무선 센서 네트워크(WSNs)는 일반적으로 수백에서 수천 개의 센서 노드들로 구성되어 있다. 이러한 대형 WSNs는 비용 및 에너지를 고려한 에너지 효율성뿐만 아니라 네트워크의 유지 및 관리가 요구된다. 사용자는 효율적인 시스템을 통해서 사용자 수준의 센싱 서비스 품질을 제공받을 수 있어야 한다. 이 네트워크에서 사용자에게 제공되는 결과 데이터의 품질은 이벤트 검출에 관련된 센서들의 개수가 결정적인 역할을 한다. 그러므로 사용자 요구 품질에 적합한 QoS를 제공할 수 있는 네트워크 프로토콜은 일부 센서 노드들에서 에러가 발생하더라고 전체 시스템 성능에 영향을 주지 않으면서, 동시에 에너지 소비가 최소화되도록 설계되어야 한다. 본 논문에서 제안된 프로토콜은 LEACH(Low Energy Adaptive Clustering Hierarchy) 프로토콜을 기반으로 하며, 지속적인 감시가 요구되는 대형 네트워크에 적합한 역할 기반의 자가 구성 프로토콜을 제안하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3738-3750
• /
• 2015

Sybil attack is a special kind of attack which is difficult to be detected in Wireless Sensor Network (WSN). So a lightweight detection mechanism based on LEACH-RSSI-ID (LRD) is proposed in this paper. Due to the characteristic of Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, none of nodes can be the cluster head forever.

• Journal of Information Processing Systems
• /
• 제1권1호
• /
• pp.49-54
• /
• 2005

With the recent advances in Micro Electro Mechanical System (MEMS) technology, low cost and low power consumption wireless micro sensor nodes have become available. However, energy-efficient routing is one of the most important key technologies in wireless sensor networks as sensor nodes are highly energy-constrained. Therefore, many researchers have proposed routing protocols for sensor networks, especially cluster-based routing protocols, which have many advantages such as reduced control messages, bandwidth re-usability, and improved power control. Some protocols use information on the locations of sensor nodes to construct clusters efficiently. However, it is rare that all sensor nodes know their positions. In this article, we propose another cluster-based routing protocol for sensor networks. This protocol does not use information concerning the locations of sensor nodes, but uses the remaining energy of sensor networks and the desirable number of cluster heads according to the circumstances of the sensor networks. From performance simulation, we found that the proposed protocol shows better performance than the low-energy adaptive clustering hierarchy (LEACH).

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.384-389
• /
• 2012

In this paper, we examine the problems of the low energy adaptive clustering hierarchy (LEACH) protocol and present ideas for improvement by selecting the cluster head node. The main problem with LEACH lies in the random selection of cluster heads. There exists a probability that the formed cluster heads are unbalanced and may remain in one part of the network, which makes some part of the network unreachable. In this paper, we present a new version of the LEACH protocol called the improved LEACH (ILEACH) protocol, which a cluster head is selected based on its ratio between the current energy level and an initial energy level, and multiplies by the root square of its number of neighbor nodes. The simulation results show that the proposed ILEACH increases the energy efficiency and network lifetime.

• International Journal of Computer Science & Network Security
• /
• 제21권9호
• /
• pp.230-238
• /
• 2021

A sensor network is made up of many sensors deployed in different areas to be monitored. They communicate with each other through a wireless medium. The routing of collected data in the wireless network consumes most of the energy of the network. In the literature, several routing approaches have been proposed to conserve the energy at the sensor level and overcome the challenges inherent in its limitations. In this paper, we propose a new low-energy routing protocol for power grids sensors based on an unsupervised clustering approach. Our protocol equitably harnesses the energy of the selected cluster-head nodes and conserves the energy dissipated when routing the captured data at the Base Station (BS). The simulation results show that our protocol reduces the energy dissipation and prolongs the network lifetime.

• Journal of Information Processing Systems
• /
• 제16권4호
• /
• pp.845-858
• /
• 2020

This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• 한국전자통신학회논문지
• /
• 제18권4호
• /
• pp.609-616
• /
• 2023

무선 네트워크 환경에서 센서들은 전원 공급을 위해 상시 전원이 연결되어 있는 것은 아니기 때문에 센서들에게 공급되는 에너지원인 배터리의 수명은 한정되어 있다. 따라서 네트워크 수명을 연장하는 다양한 연구들이 진행되어 왔으며, 효율적인 에너지 사용을 위해 계층기반 라우팅 프로토콜인 LEACH(: Low-energy Adaptive Clustering Hierarchy)가 등장하였다. 하지만 데이터 송신 시 전송거리의 제곱만큼의 에너지 소모가 이루어지기 때문에 융합된 데이터를 싱크 노드에 직접 전송하는 LEACH 프로토콜은 에너지 소모가 크다는 제한사항을 가지고 있다. 본 논문에서는 이러한 제한사항을 개선하기 위해, 매 라운드마다 클러스터 헤드들이 싱크 노드와의 상대적인 거리 계산을 통해 클러스터 헤드 간 체이닝 연결되는 멀티 홉 전송으로 전송거리를 최소화할 수 있는 알고리즘을 제안한다.

• 한국통신학회논문지
• /
• 제19권7호
• /
• pp.1282-1295
• /
• 1994

본 논문에서는 계층 버스 구조를 기반으로 하는 계층 클러스터 다중프로세서 시스템(hierarchical cluster multiprocessor system)을 제안하고, 이 구조에 효율적인 캐쉬 일관성 프로토콜을 설계 및 구현한다. 계층 클러스터 구조는 클러스터 수의 증가에 따라 버스 계층을 추가함으로써 기존의 단일 버스 시스템에서의 병목 현상(bottleneck)을 없애주어 시스템 확장이 용이하게 된다. 제안된 캐쉬 프로토콜은 일반적인 N-레벨 (N>2) 계층 클러스터 구조에 적용할 수 있도록 설계되었다. 이를 시스템 버스에 구현하기 위하여 기존의 팬디드 프로토콜을 확장하였고 캐쉬 일관성 동작들을 확장된 팬디드 프로토콜상에서 설명한다.