• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.224-242
• /
• 2010

Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• 전기전자학회논문지
• /
• 제13권1호
• /
• pp.71-76
• /
• 2009

As one of the most important requirements for wireless sensor networks, prolonging network lifetime can be realized by minimizing energy consumption in cluster heads as well as sensor nodes. While most of the previous researches have focused on the energy of sensor nodes, we devote our attention to cluster heads because they are most dominant source of power consumption in the cluster-based sensor networks. Therefore, we seek to minimize energy consumption by minimizing the maximum(MINMAX) energy dissipation at each cluster heads. This work requires energy-efficient clustering of the sensor nodes while satisfying given energy constraints. In this paper, we present a constraint satisfaction modeling of cluster-based routing in a heterogeneous sensor networks because mixed integer programming cannot provide solutions to this MINMAX problem. Computational experiments show that substantial energy savings can be obtained with the MINMAX algorithm in comparison with a minimum total energy(MTE) strategy.

• 한국컴퓨터정보학회논문지
• /
• 제13권7호
• /
• pp.139-148
• /
• 2008

센서네트워크는 다양한 분야에서 활용되고 있다. 센서네트워크 노드들이 모바일 환경으로 진화함에 따라 클러스터를 구축하고 클러스터 헤더를 선정함에 있어 이에 적합한 방법으로 구축해야 한다. 본 논문에서는 동적 스카이라인 질의 속성 중 방향, 앵글, 홉을 메트릭스로 이용한 동적 예측클러스터링 알고리즘을 제안한다. 제안 알고리즘은 이동 센서노드를 중심으로 클러스터를 형성하고 클러스터 헤더를 선정하는 알고리즘이다. 제안 알고리즘에서는 "Adv"메시지 발생으로 이동 센서노드의 불필요한 에너지 낭비를 줄이고 효율적인 클러스터링을 위한 센서노드의 밀집도에 따라 동적 클러스터를 형성하여 센서노드의 평균 에너지를 2.9배 줄여 네트워크 생명주기를 연장해 준다. 또한 동적 클러스터를 유지함으로 클러스터 내 홉 수를 최적화하여 노드의 평균 에너지 소비율이 14% 감소하였다.

• 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).

• 한국멀티미디어학회논문지
• /
• 제21권6호
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• 전기전자학회논문지
• /
• 제27권4호
• /
• pp.679-682
• /
• 2023

무선센서 네트워크에서 센서 노드간의 통신 연결 실패는 계속된 연결 시도를 유발하여 많은 전력 손실이 발생한다. 본 논문에서는 CH(Cluster Head) 노드와 통신되는 센서 노드 사이의 적정 거리를 제한하여, 2차원 평면상에 적정 크기의 클러스터 그룹이 형성되도록 하였다. 클러스터 크기의 균일화를 위해 최단 거리에 존재하는 센서 노드들이 서로 통신하여 멤버 노드를 구성하고 근접한 노드를 모아서 클러스터가 형성되도록 하였다. 제안한 클러스터 균일화 알고리즘을 기반으로 클러스터링을 위한 최단 거리 기반의 클러스터링 방식에 대한 클러스터 균일화 개선율을 시뮬레이션 결과로 나타내었다. 제안한 방식은 네트워크의 클러스터 균일성을 약 30% 향상시킬 수 있다.

• 한국정보통신학회논문지
• /
• 제11권6호
• /
• pp.1201-1206
• /
• 2007

본 논문에서는 클러스터링 방식을 사용하는 무선 센서네트워크(WSN)에서 센서노드의 위치정보에 따라 클러스터의 크기를 다르게 설정하여, 네트워크의 수명을 향상시키는 알고리즘을 제안한다. 각 클러스터에서 수집된 정보는 클러스터 간(Inter-cluster) 통신으로 멀티 홉을 통하여 싱크노드에 전달된다. 싱크노드에 가까운 곳에 위치한 클러스터 헤더(CH)일수록 멀리 있는 클러스터 헤더보다 데이터 전달에 많이 관여하게 되어 에너지를 더욱 많이 소모하며 이로 인해서 네트워크의 수명이 줄어든다. 제안된 알고리즘은 싱크노드에 가까이 위치한 클러스터의 크기를 줄여서, 해당 클러스터 헤더에서의 에너지 소모를 최소화하고, 또한 싱크로 향하는 데이터들의 전송 경로를 다양화하여 클러스터 헤더의 통신 부담을 경감시킴으로써 네트워크의 수명을 연장시킨다. 제안된 알고리즘은 수학적인 분석 과정을 통해 성능을 검증하였다.

• 대한임베디드공학회논문지
• /
• 제9권6호
• /
• pp.361-367
• /
• 2014

This paper introduces balancing energy and memory consumption for lifetime increase of wireless sensor network. In cluster-based wireless sensor network, sensor nodes adjacent of cluster heads have a tendency to deplete their own battery energy and cluster heads occupy memory space significantly. If the nodes close to region where events occur frequently consume their energy and memory fully, network might be destroyed even though most of nodes are still alive. Therefore, it needs to balance network energy and memory with consideration of event occurrence probability so that network lifetime is increased. We show a method of balancing wireless sensor network energy and memory to organize cluster groups and elect cluster heads in terms of event occurrence probability.