Distributed Clustering-Based Aggregation Algorithm for Spatial Correlated Sensor Networks

@article{Ma2011DistributedCA,
  title={Distributed Clustering-Based Aggregation Algorithm for Spatial Correlated Sensor Networks},
  author={Yajie Ma and Yike Guo and Xiangchuan Tian and Moustafa M. Ghanem},
  journal={IEEE Sensors Journal},
  year={2011},
  volume={11},
  pages={641-648}
}
In wireless sensor networks, it is already noted that nearby sensor nodes monitoring an environmental feature typically register similar values. This kind of data redundancy due to the spatial correlation between sensor observations inspires the research of in-network data aggregation. In this paper, an α -local spatial clustering algorithm for sensor networks is proposed. By measuring the spatial correlation between data sampled by different sensors, the algorithm constructs a dominating set… 

Figures and Tables from this paper

Data aggregation of Moving Object with Dynamic Clustering in Wireless Sensor Network
TLDR
A more realistic spatial correlation analysis is introduced that makes the RD theory based aggregation model to be more efficient.
A Novel Method for Data Aggregation using Spatial Correlation Clustering Method
TLDR
A correlation method is introduced, the correlation between a sensor node’s data and its neighboring sensor nodes’ data is measured, and a data correlation clustering method is presented, where a representative node is elected and sends its observation to the sink, thus reducing the number of transmissions to the sinks.
Performance evaluation of data aggregation for cluster-based wireless sensor network
TLDR
The entropy is computed from the proposed local and global probability models that provide assistance in extracting high precision data from the sensor nodes and an energy efficient method for clustering the nodes in the network is proposed.
An adaptive data aggregation technique for dynamic cluster based Wireless Sensor Networks
  • Rabia Noor Enam, R. Qureshi
  • Computer Science
    2014 23rd International Conference on Computer Communication and Networks (ICCCN)
  • 2014
TLDR
The main feature of the proposed aggregation method is that in addition to reducing the cost of redundant data transfer in the network, it also optimally utilizes the available space in a packet at each cluster head.
A Research on Decentralized Clustering Algorithms for Dense Wireless Sensor Networks
TLDR
A comparative analysis of different decentralized clustering algorithms used in wireless sensor networks is elaborated based on some metrics such as node mobility, cluster count, cluster head selection, etc.
A Research on Decentralized Clustering Algorithms for Dense Wireless Sensor Networks
TLDR
A comparative analysis of different decentralized clustering algorithms used in wireless sensor networks is elaborated based on some metrics such as node mobility, cluster count, cluster head selection, etc.
Transmission Policies for Data Aggregation using Cooperate Node in Wireless Sensor Networks
TLDR
The simulation results show that the resulting representative data achieve using the proposed modified data density correlation degree clustering method have better throughput, packet delivery ratio, dropping ratio, delay, normalized overhead and average energy consumption than those achieved using the datadensity correlation degree clusters method.
Data Density Correlation Degree Clustering Method for Data Aggregation in WSN
TLDR
The data density correlation degree is a spatial correlation measurement that measures the correlation between a sensor node's data and its neighboring sensor nodes' data and the shape of clusters obtained by DDCD clustering method can be adapted to the environment.
Analysis of Energy Consuming for Correlation Based Data Aggregation
TLDR
A Data Density Correlation Degree (DDCD) is proposed to measure the correlation between sensor node data and its neighbouring sensor nodes data in communication uncertain conditions and results show that the energy consumption of nodes is minimum compared with the existing system.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
CAC: Context Adaptive Clustering for Efficient Data Aggregation in Wireless Sensor Networks
TLDR
A context adaptive clustering mechanism is proposed, which tries to form clusters of sensors with similar output data within the bound of a given tolerance parameter, which can reduce energy consumption and prolong the sensor lifetime.
Scale Free Aggregation in Sensor Networks
TLDR
This work proposes a very simple randomized algorithm for routing information on a grid of sensors in a way which promotes data aggregation and proves that this simple scheme is a constant factor approximation to the optimum aggregation tree simultaneously for all correlation parameters k.
A Survey on Clustering Algorithms for Wireless Sensor Networks
TLDR
This paper synthesises existing clustering algorithms news's and highlights the challenges in clustering.
Effect of partially correlated data on clustering in wireless sensor networks
  • Mahdi Lotfinezhad, B. Liang
  • Computer Science
    2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004.
  • 2004
TLDR
It is shown that when a moderate amount of correlation is available, the optimal probabilities that lead to minimum energy consumption are far from optimality in terms of network lifetime, and a novel analytical framework is proposed to study how partially correlated data affect the performance of clustering algorithms.
The impact of spatial correlation on routing with compression in wireless sensor networks
TLDR
The existence of a simple, practical, and static correlation-unaware clustering scheme that satisfies a min-max near-optimality condition is shown and the implication for system design is that a static correlation -unaware scheme can perform as well as sophisticated adaptive schemes for joint routing and compression.
TASC: topology adaptive spatial clustering for sensor networks
  • R. Virrankoski, A. Savvides
  • Computer Science
    IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
  • 2005
TLDR
The topology adaptive spatial clustering (TASC) algorithm presented here is a distributed algorithm that partitions the network into a set of locally isotropic, non-overlapping clusters without prior knowledge of the number of clusters, cluster size and node coordinates.
Aggregation tree construction in sensor networks
  • M. Ding, X. Cheng, G. Xue
  • Computer Science
    2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)
  • 2003
TLDR
The main idea is to turn off the radio of all leaf nodes to save power, and thereby extending the network lifetime, which makes the EADAT algorithm very efficient and effective, as demonstrated by the simulation experiments with NS2.
Performance evaluation of load-balanced clustering of wireless sensor networks
  • G. Gupta, M. Younis
  • Computer Science
    10th International Conference on Telecommunications, 2003. ICT 2003.
  • 2003
TLDR
Simulation results shows that irrespective of the routing protocol used, this approach improves the lifetime of the system and Load balanced clustering increases the system stability and improves the communication between different nodes in the system.
Grid-based Coordinated Routing in Wireless Sensor Networks
  • R. Akl, U. Sawant
  • Computer Science
    2007 4th IEEE Consumer Communications and Networking Conference
  • 2007
TLDR
This work explores grid-based coordinated routing in wireless sensor networks and compares the energy available in the network over time for different grid sizes.
Efficient Clustering Scheme Considering Non-uniform Correlation Distribution for Ubiquitous Sensor Networks
TLDR
Through the simulation under the non-uniform correlation distribution, the advantage of the proposed clustering scheme in terms of the energy consumption property per node and the network lifetime is shown.
...
1
2
3
4
5
...