## AI helps you reading Science

## AI Insight

AI extracts a summary of this paper

Weibo:

# Distributed clustering-based aggregation algorithm for spatial correlated sensor networks

IEEE Sensors Journal, no. 3 (2011): 641-648

WOS SCOPUS EI

Keywords

Abstract

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 algorit...More

Code:

Data:

Introduction

- A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions [1], [2].
- In 1970, Tobler’s first law of geography was formulated to state that “Everything is related to everything else, but near things are more related than distant things” [3]
- This statistical observation implies that data correlation increases with decreasing spatial separation.

Highlights

- A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions [1], [2]
- We propose a new distributed clustering algorithm based on the dominating set theory to choose the CHs and construct clusters by measuring the spatial correlation between sensors
- We proposed an -local spatial clustering algorithm for wireless sensor network
- The experimental results show that the aggregated network can provide the environmental information in very high accuracy in comparison with the original network
- This algorithm is useful for the applications such as the environmental surveillance where the sensors are always distributed in very high density

Methods

- Output: Weighted -Dominating Set (Step1) ;.
- Pardo { / Parallel process for (2.1) node is a dominatee; (2.2).
- 1. Each GD broadcasts an INDICATOR message embedded with its identity to all its -neighbors to indicate its dominator status.
- 2. Each dominatee chooses a cluster to join: a.
- If receives only one INDICATOR message from a dominator , it join the cluster of.
- INDICATOR messages from a set of dominators.
- Chooses a to join if it satisfies: 3.
- If dominatee decides to join , it sends a

Results

- AGGREGATION interval for the population mean is reached and, simulation results are measured by taking the average of all cases.
- The values of is set to ensure that the number of ID is about 5%, 10%.
- . Each node randomly picks up a data item from the dataset as its sampled data.
- These data are used to calculate the Spatial Correlated Weight

Conclusion

**CONCLUSION AND FUTURE WORK**

In this paper, the authors proposed an -local spatial clustering algorithm for WSNs.- The experimental results show that the aggregated network can provide the environmental information in very high accuracy in comparison with the original network.
- This algorithm is useful for the applications such as the environmental surveillance where the sensors are always distributed in very high density

Summary

## Introduction:

A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor physical or environmental conditions [1], [2].- In 1970, Tobler’s first law of geography was formulated to state that “Everything is related to everything else, but near things are more related than distant things” [3]
- This statistical observation implies that data correlation increases with decreasing spatial separation.
## Objectives:

The authors' aim is to develop methods that can focus the attention of the network resources only on relevant information for the task at hand.## Methods:

Output: Weighted -Dominating Set (Step1) ;.- Pardo { / Parallel process for (2.1) node is a dominatee; (2.2).
- 1. Each GD broadcasts an INDICATOR message embedded with its identity to all its -neighbors to indicate its dominator status.
- 2. Each dominatee chooses a cluster to join: a.
- If receives only one INDICATOR message from a dominator , it join the cluster of.
- INDICATOR messages from a set of dominators.
- Chooses a to join if it satisfies: 3.
- If dominatee decides to join , it sends a
## Results:

AGGREGATION interval for the population mean is reached and, simulation results are measured by taking the average of all cases.- The values of is set to ensure that the number of ID is about 5%, 10%.
- . Each node randomly picks up a data item from the dataset as its sampled data.
- These data are used to calculate the Spatial Correlated Weight
## Conclusion:

**CONCLUSION AND FUTURE WORK**

In this paper, the authors proposed an -local spatial clustering algorithm for WSNs.- The experimental results show that the aggregated network can provide the environmental information in very high accuracy in comparison with the original network.
- This algorithm is useful for the applications such as the environmental surveillance where the sensors are always distributed in very high density

- Table1: RESULTS OF NETWORK AGGREGATION
- Table2: ACCURACY PERFORMANCE OF PATTERN RECOGNITION
- Table3: ACCURACY PERFORMANCE COMPARISON

Related work

- Many clustering algorithms have been proposed for ad-hoc and sensor networks recently. LEACH [4] is the most famous application-specific algorithm that uses clustering to prolong the network lifetime. As clustering is vital for efficient resource utilization and load balancing in large-scale sensor networks, it is not surprising that an increasing amount of research interest has been drawn towards clustering algorithms during the last few years. In general, such research can be classified primarily into two perspectives either finding a smallest set of the CHs based on Graph Theory, or finding an optimal set of the CHs based on residual energy of each node.

From the graph theory perspective, heuristic algorithms are always used to generate approximate results based on either a centralized or distributed model of operation. For a centralized model, Guha and Khuller propose two CDS (Connected Dominating Set) construction strategies in [27], which contain two greedy heuristic algorithms with bounded performance guarantees. Other algorithms, e.g., [28] and [29], are motivated by either of these two heuristics. However, for large-scale WSNs, a distributed CDS algorithm could be more effective due to the lack of a centralized administration. An example of the distributed implementations of [27] is provided in [30]. Other greedy heuristics including [31]–[33] have also come under investigation recently. Moreover, distributed CDS construction approaches have also been investigated based on Maximum Independent Set [34], multipoint relaying [35], and Spanning Tree [36].

Funding

- This work was supported in part by the EPSRC Project Mobile Environmental Sensing System Across a Grid Environment (MESSAGE) under Grant EP/E002102/1 and jointly funded by the Engineering and Physical Sciences Research Council and the Department for Transport

Reference

- K. Römer and F. Mattern, “The design space of wireless sensor networks,” IEEE Wireless Commun., vol. 11, no. 6, pp. 54–61, 2004.
- T. Haenselmann, “Sensornetworks,” in GFDL Wireless Sensor Network, Aug. 2006. [Online]. Available: http://www.informatik.uni-mannheim.de/~haensel/sn_book
- W. R. Tobler, “A computer movie simulating urban growth in the Detroit region,” Economic Geography, vol. 46, no. 2, pp. 234–240, 1970.
- W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor network,” IEEE Trans. Wireless Commun., vol. 1, pp. 660–670, 2002.
- A. Manjeshwar, Q. Zeng, and D. P. Agrawal, “An analytical model for information retrieval in wireless sensor networks using enhanced APTEEN protocol,” IEEE Trans. Paralell and Distri. Syst., vol. 13, no. 12, pp. 1290–1302, 2002.
- O. Younis and S. Fahmy, “Heed: A hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks,” IEEE Trans. Mobile Computing, vol. 3, no. 4, pp. 660–669, 2004.
- S. Ghiasi, A. Srivastava, X. Yang, and M. Sarrafzadeh, “Optimal energy aware clustering in sensor networks,” Sensors, vol. 2, pp. 258–269, 2002.
- M. Gerla, T. J. Kwon, and G. Pei, “On demand routing in large ad hoc wireless networks with passive clustering,” in Proc. IEEE Wireless Commun. Networking Conf. (WCNC2000), Chicago, IL, Sep. 2000, vol. 1, pp. 100–105.
- R. Virrankoski and A. Savvides, “TASC: Topology adaptive spatial clustering for sensor networks,” in Proc. IEEE Int. Conf. Mobile Adhoc and Sensor Systems, Washington, DC, Nov. 2005, pp. 605–614.
- G. Gupta and M. Younis, “Performance evaluation of load-balanced clustering of wireless sensor networks,” in Proc. 10th Int. Conf. Telecommun., Tahiti, Papeete, French Polynesia, Mar. 2003, vol. 2, pp. 1577–1583.
- D. Baker and A. Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” Tran. Commun., vol. 29, no. 11, pp. 1694–1701, 1981.
- M. Chatterjee, S. K. Das, and D. Turgut, “WCA: A weighted clustering algorithm for mobile ad hoc networks,” J. Cluster Computing (Special Issue on Mobile Ad Hoc Networks), vol. 5, pp. 193–204, 2002.
- A. Abbasi and M. Younis, “A survey on clustering algorithms for wireless sensor networks,” Computer Commun., vol. 30, pp. 2826–2841, 2007.
- M. Lotfinezhad and B. Liang, “Effect of partially correlated data on clustering in wireless sensor networks,” in Proc. 1st Annu. IEEE Commun. Soc. Conf. Sensor and Ad Hoc Commun. Networks, Santa Clara, CA, Oct. 2004, pp. 172–181.
- R. Cristescu and B. Beferull-Lozano, “Lossy network correlated data gathering with high-resolution coding,” IEEE Trans. Informat. Theory, vol. 52, no. 6, pp. 2817–2824, 2006.
- J. Barros, C. Peraki, and S. D. Servetto, “Efficient network architectures for sensor reachback,” in Proc. IEEE Int. Zurich Seminar on Commun., 2004, pp. 184–187.
- M. Enachescu, A. Goel, R. Govindan, and R. Motwani, “Scale free aggregation in sensor networks,” Theoretical Comput. Sci., vol. 344, no. 1, pp. 15–29, 2004.
- D. Marco, E. Duarte-Melo, M. Liu, and D. L. Neuhoff, “On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data,” in Proc. Int. Workshop on Information Processing in Sensor Networks, Palo Alto, CA, 2003, pp. 1–16.
- S. Pattem, B. Krishnamachari, and R. Govindan, “The impact of spatial correlation on routing with compression in wireless sensor networks,” in Proc. Int. Workshop on Information Processing in Sensor Networks, Berkeley, CA, 2004, pp. 28–35.
- A. Scaglione and S. Servetto, “On the interdependence of routing and data compression in multi-hop sensor networks,” in Proc. 8th ACM Int. Conf. Mobile Computing and Networking, Altanta, GA, Sep. 2002, pp. 140–147.
- A. Scaglione, “Routing and data compression in sensor networks: Stochastic models for sensor data that guarantee scalability,” in Proc. IEEE Int. Symp. Informat. Theory, Yokohama, Japan, Jun. 2003, p. 174.
- D. Maeda, H. Uehara, and M. Yokoyama, “Efficient clustering scheme considering non-uniform correlation distribution for ubiquitous sensor networks,” IEICE Trans. Fundamentals of Electron., Commun. Comput. Sci., vol. E90-A, no. 7, pp. 1344–1352, 2007.
- L. Badia, E. Fasolo, A. Paganini, and M. Zorzi, “Data aggregation algorithms for sensor networks with geographic information awareness,” in Proc. Int. Conf. Wireless Personal Multimedia Commun., San Diego, CA, Sep. 2006, pp. 1214–1218.
- S. Yoon and C. Shahabi, “The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks,” ACM Trans. Sensor Networks, vol. 3, no. 1, 2007.
- G.-Y. Jin and M.-S. Park, “CAC: Context adaptive clustering for efficient data aggregation in wireless sensor networks,” Networking, vol. 3976, pp. 1132–1137, 2006.
- P. Schaffer and I. Vajda, “CORA: Correlation-based resilient aggregation in sensor networks,” in Proc. 10th ACM/IEEE Int. Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, Chania, Crete, Greece, Oct. 2007, pp. 373–376.
- S. Guha and S. Khuller, “Approximation algorithms for connected dominating sets,” Algorithmica, vol. 20, no. 4, pp. 374–387, 1998.
- X. Cheng, “Routing issues in ad hoc wireless networks,” Ph.D. dissertation, Dept. Comput. Sci., Univ. Minnesota, Minneapolis, MN, 2002.
- P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed construction of connected dominating sets in wireless ad hoc networks,” Discrete Algorithms and Methods for Mobile Comput. Commun., vol. 9, no. 2, pp. 141–149, 2004.
- B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in Proc. Int. Conf. Commun., Montreal, Canada, Jun. 1997, pp. 376–380.
- Y. Ma, Y. Guo, and M. Ghanem, “RECA: Referenced energy-based CDS algorithm in wireless sensor networks,” Int. J. Commun. Syst., vol. 23, no. 1, pp. 125–138, 2010.
- Z. Yuanyuan, J. Xiaohua, and H. Yanxiang, “A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks,” Int. J. Sensor Networks, vol. 2, no. 1/2, pp. 68–76, 2007.
- F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “A dominating sets and target radius based localized activity scheduling and minimum energy broadcast protocol for ad hoc and sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 6, pp. 536–547, 2006.
- W. Wu, H. Du, X. Jia, Y. Li, and S. C.-H. Huang, “Minimum connected dominating sets and maximal independent sets in unit disk graphs,” Theoretical Comput. Sci., vol. 352, no. 1, pp. 1–7, 2006.
- C. Adjih, P. Jacquet, and L. Viennot, “Computing connected dominated sets with multipoint relays,” Ad Hoc Sensor Networks, vol. 1, no. 1, pp. 27–39, 2005.
- J. Cartigny, F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks,” Ad Hoc Networks, vol. 3, no. 1, pp. 1–16, 2004.
- S. Lindsey and C. S. Raghavendra, “PEGASIS: Power-efficient gathering in sensor information systems,” in Proc. 2002 IEEE Aerosp. Conf., Big Sky, MT, 2002, pp. 1123–1130.
- A. Manjeshwar and D. P. Agrawal, “TEEN: A routing protocol for enhanced efficiency in wireless sensor network,” in Proc. IEEE 15th Int. Parallel Distrib. Process. Symp., San Francisco, CA, 2001, pp. 2009–2015.
- O. Younis and S. Fahmy, “HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Trans. Mobile Comput., vol. 3, no. 4, pp. 366–379, 2004.
- J. B. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symp. Math. Statist. Probability, Berkeley, CA, 1967, pp. 281–297.
- M. Richards, M. Ghanem, M. Osmond, Y. Guo, and J. Hassard, “Gridbased analysis of air pollution data,” Ecological Modelling, vol. 194, no. 1–3, pp. 274–286, 2006.
- Y. Ma, M. Richards, M. Ghanem, Y. Guo, and J. Hassard, “Air pollution monitoring and mining based on sensor grid in London,” Sensors, vol. 8, pp. 3601–3623, 2008.
- M. Ding, X. Cheng, and G. Xue, “Aggregation tree construction in sensor networks,” in Proc. IEEE VTC’03, Orlando, FL, Oct. 2003, pp. 2168–2172.
- R. Akl and U. Sawant, “Grid-based coordinated routing in wireless sensor networks,” in Proc. 4th IEEE Consumer Commun. Networking Conf., Las Vegas, NV, 2007, pp. 860–864. Yajie Ma received the B.Sc. degree in automatic control engineering from Wuhan University of Science and Technology, Wuhan, China, in 1996, and the M.Sc. degree in circuit and system in 2000 and the Ph.D. degree in communication and information engineering in 2005 from the Huazhong University of Science and Technology, Wuhan, China.
- She worked in the Department of Computing, Imperial College of London, from 2006 to 2009, as a Research Associate. Now, she is an Associate Professor at the College of Information Science and Engineering, Wuhan University of Science and Technology. Her research focuses on wireless sensor networks, topology optimization, and data mining.
- Xiangchuan Tian received the B.Sc. degree in computing science from Huazhong University of Science and Technology, China, in 1998 and the M.Sc. degree in electronic and engineering from the University of Liverpool, Liverpool, U.K., in 2004.

Tags

Comments