• Title/Summary/Keyword: Sensor Network Clustering

Search Result 378, Processing Time 0.025 seconds

An energy efficient clustering scheme by adjusting group size in zigbee environment (Zigbee 환경에서 그룹 크기 조정에 의한 에너지 효율적인 클러스터링 기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.342-348
    • /
    • 2010
  • The wireless sensor networks have been extensively researched. One of the issues in wireless sensor networks is a developing energy-efficient clustering protocol. Clustering algorithm provides an effective way to extend the lifetime of a wireless sensor networks. In this paper, we proposed an energy efficient clustering scheme by adjusting group size. In sensor network, the power consumption in data transmission between sensor nodes is strongly influenced by the distance of two nodes. And cluster size, that is the number of cluster member nodes, is also effected on energy consumption. Therefore we proposed the clustering scheme for high energy efficiency of entire sensor network by controlling cluster size according to the distance between cluster header and sink.

Clustering Algorithms for Reducing Energy Consumption - A Review

  • Kinza Mubasher;Rahat Mansha
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.109-118
    • /
    • 2023
  • Energy awareness is an essential design flaw in wireless sensor network. Clustering is the most highly regarded energy-efficient technique that offers various benefits such as energy efficiency and network lifetime. Clusters create hierarchical WSNs that introduce the efficient use of limited sensor node resources and thus enhance the life of the network. The goal of this paper is to provide an analysis of the various energy efficient clustering algorithms. Analysis is based on the energy efficiency and network lifetime. This review paper provides an analysis of different energy-efficient clustering algorithms for WSNs.

A New Scheme for Maximizing Network Lifetime in Wireless Sensor Networks (무선 센서네트워크에서 네트워크수명 극대화 방안)

  • Kim, Jeong Sahm
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.2
    • /
    • pp.47-59
    • /
    • 2014
  • In this paper, I propose a new energy efficient clustering scheme to prolong the network lifetime by reducing energy consumption at the sensor node. It is possible that a node determines whether to participate in clustering with certain probability based on local density. This scheme is useful under the environment that sensor nodes are deployed unevenly within the sensing area. By adjusting the probability of participating in clustering dynamically with local density of nodes, the energy consumption of the network is reduced. So, the lifetime of the network is extended. In the region where nodes are densely deployed, it is possible to reduce the energy consumption of the network by limiting the number of node which is participated in clustering with probability which can be adjusted dynamically based on local density of the node. Through computer simulation, it is verified that the proposed scheme is more energy efficient than LEACH protocol under the environment where node are densely located in a specific area.

Data-centric Energy-aware Re-clustering Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 데이터 중심의 에너지 인식 재클러스터링 기법)

  • Choi, Dongmin;Lee, Jisub;Chung, Ilyong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.5
    • /
    • pp.590-600
    • /
    • 2014
  • In the wireless sensor network environment, clustering scheme has a problem that a large amount of energy is unnecessarily consumed because of frequently occurred entire re-clustering process. Some of the studies were attempted to improve the network performance by getting rid of the entire network setup process. However, removing the setup process is not worthy. Because entire network setup relieves the burden of some sensor nodes. The primary aim of our scheme is to cut down the energy consumption through minimizing entire setup processes which occurred unnecessarily. Thus, we suggest a re-clustering scheme that considers event detection, transmitting energy, and the load on the nodes. According to the result of performance analysis, our scheme reduces energy consumption of nodes, prolongs the network lifetime, and shows higher data collection rate and higher data accuracy than the existing schemes.

Fundamental Considerations: Impact of Sensor Characteristics, Application Environments in Wireless Sensor Networks

  • Choi, Dongmin;Chung, Ilyong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.4
    • /
    • pp.441-457
    • /
    • 2014
  • Observed from the recent performance evaluation of clustering schemes in wireless sensor networks, we found that most of them did not consider various sensor characteristics and its application environment. Without considering these, the performance evaluation results are difficult to be trusted because these networks are application-specific. In this paper, for the fair evaluation, we measured several clustering scheme's performance variations in accordance with sensor data pattern, number of sensors per node, density of points of interest (data density) and sensor coverage. According to the experiment result, we can conclude that clustering methods are easily influenced by POI variation. Network lifetime and data accuracy are also slightly influenced by sensor coverage and number of sensors. Therefore, in the case of the clustering scheme that did not consider various conditions, fair evaluation cannot be expected.

A Clustering Protocol with Mode Selection for Wireless Sensor Network

  • Kusdaryono, Aries;Lee, Kyung-Oh
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.29-42
    • /
    • 2011
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

A Study for Improving WSNs(Wireless Sensor Networks) Performance using Clustering and Location Information (Clustering 및 위치정보를 활용한 WSN(Wireless Sensor Network) 성능 향상 방안 연구)

  • Jeon, Jin-han;Hong, Seong-hun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.260-263
    • /
    • 2019
  • Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services to regions where the access is difficult or services that require continuous monitoring, has gradually increased due to its expansion and efficiency of the application areas. In this paper, we analyze existing researches which focused on reducing packet loss rate and increasing lifetime of sensor nodes. Then, we conduct studies about performance improvement factors where some schemes - clustering and location-based approaches - are applied and compare our study results with existing researches. Based on our studies, we are planning to conduct researches about a new scheme that could contribute to improve WSN's performance in terms of packet loss rate and network lifetime.

  • PDF

Data Correlation-Based Clustering Algorithm in Wireless Sensor Networks

  • Yeo, Myung-Ho;Seo, Dong-Min;Yoo, Jae-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.3
    • /
    • pp.331-343
    • /
    • 2009
  • Many types of sensor data exhibit strong correlation in both space and time. Both temporal and spatial suppressions provide opportunities for reducing the energy cost of sensor data collection. Unfortunately, existing clustering algorithms are difficult to utilize the spatial or temporal opportunities, because they just organize clusters based on the distribution of sensor nodes or the network topology but not on the correlation of sensor data. In this paper, we propose a novel clustering algorithm based on the correlation of sensor data. We modify the advertisement sub-phase and TDMA schedule scheme to organize clusters by adjacent sensor nodes which have similar readings. Also, we propose a spatio-temporal suppression scheme for our clustering algorithm. In order to show the superiority of our clustering algorithm, we compare it with the existing suppression algorithms in terms of the lifetime of the sensor network and the size of data which have been collected in the base station. As a result, our experimental results show that the size of data is reduced and the whole network lifetime is prolonged.

A Clustering Method Considering the Threshold of Energy Consumption Model in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 소모 모델의 임계값을 고려한 클러스터링 기법)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.10
    • /
    • pp.3950-3957
    • /
    • 2010
  • Wireless sensor network is composed of sensor node with limited sources, and to maintain and repair is vexatious once made up. Accordingly it is important matter to maximize the network lifetime by minimizing the energy consumption in wireless sensor network, and utilizing the limited sources efficiently. In this paper, I propose a technique arranging the cluster number with efficiency in clustering method to optimize the energy consumption. The energy usage needed for wireless transmission varies in distance(threshold). This technique reduces the energy consumption considering the threshold when arranging the cluster number. I verify that the clustering method organized through the valid processes outperform the LEACH(Low-Energy Adaptive Clustering Hierarchy) in total energy consumption.

Clustering Optimal Design in Wireless Sensor Network using Ant Colony Optimization (개미군 최적화 방법을 적용한 무선 센서 네트워크에서의 클러스터링 최적 설계)

  • Kim, Sung-Soo;Choi, Seung-Hyeon
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.55-65
    • /
    • 2009
  • The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.