Open Access Open Access  Restricted Access Subscription or Fee Access

Data Reduction Mechanism Using Coverage Based Association Method in Wireless Sensor Networks

R. Gunasundari, K. Muthukumaran


The advance in wireless technologies and microelectronic devices has led to the development of sensor nodes that are capable of sensing, processing, and transmitting data. This new trend in sensor technology led the design of wireless sensor networks (WSNs). A WSN consists of several sensor nodes that are designed to “sense” the environment around them and send, in cooperation with each other, detected events to a well-equipped node referred to as the “sink.” The detected events are transmitted to the sink in the following three ways: 1) periodically 2) upon satisfying a particular predicate (event based) 3) as an answer to a query (query based). Due to distributed nature and the limited resources of sensor nodes (e.g. energy, communication, and computation) and unreliability of wireless communication increase the possibility of errors, lost messages, delays in data delivery, and losses of functionality. These factors are potentially devastating to the performance and the overall quality of service of WSNs. In order to improve the performance and quality of service of WSNs, sensor association method has been proposed. Sensor Association method (SA) discovers the correlation between all sensor nodes in the WSNs, regardless of their locations. In SA method, coverage is main drawback. To address this issue, coverage based association method has been proposed. The main goal of the coverage based association method is to improve the coverage as well as the performance and quality of service of WSNs. In this work, the performance metrics in terms of amount of redundant data, energy consumption and packet delivery ratio for coverage based association method and sensor association method have been analyzed and compared.


Data Reduction, Sensor Association Method, Coverage Based Association Method.

Full Text:



Azzedine Boukerche and Samer Samarah, “In-network datareduction and coverage based mechanism for generating association rules in wireless sensor network,” IEEE Transactions vehicular technology, vol. 58, no. 8, pp. 870–887, Oct. 2009.

Romer.K, “Distributed mining of spatio-temporal event patterns in sensor networks,” In Proc. Euro-American Workshop Middleware Sensor Networks/DCOSS, San Francisco, CA, pp. 103–116, Jun.2006.

Akyildiz.W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Netowrks,” IEEE Communications Magazine, vol. 40, no. 8,pp. 102–114, Aug 2002.

K. K. Loo, I. Tong, B. Kao, and D. Chenung, “Online algorithms for mining inter-stream associations from large sensor networks,” in Proc.9th PAKDD, Hanoi,Vietnam, pp. 143–149, May2005.

G. S. Manku and R. Motwani, “Approximate frequency counts over streaming data”, In Proc. 28th Int. Conf. Very Large Data Bases, Hong Kong, pp. 346–357,Aug. 2002.

M. Halatchev and L. Gruenwald, “Estimating missing values in related sensor data streams,” in Proc. 11th Int. Conf. Management Data, Goa,India, pp. 83–94, Jan. 2005.

A. Boukerche and S. Samarah, “A novel algorithm for mining association rules in wireless ad hoc sensor networks,” IEEE Trans. Parallel Distrib. Syst.,vol.19, no. 7, pp.865–877, July.2008.

S.Hwang, Y. Su, Y. Lin, and C. Dow, “A cluster-based coverage-preserved node scheduling scheme in wireless sensor networks”, In Proc. 3rd Annu. Int. Conf. Mobile Ubiquitous Syst. Workshops, pp. 1–7, 2006.

C. Huang and Y. Tseng, “The coverage problem in a wireless sensor network”, In Proc. 2nd ACM Int. Conf. Wireless Sensor Networks Appl.,San Diego, CA, pp. 115–121, Sep. 2003.

D. Tian and N.D. Georganas, “A coverage-preserving node scheduling scheme for large wireless sensor networks,” in Proc. 1st ACM Int. Workshop Wireless Sens. Netw. Appl., Atlanta, GA, pp. 32–41, Sep. 2002.

Sophia-Antipolis, France “NS Simulator for beginners” Univ. de Los Andes, Merida, Venezuela and ESSI, Sophia Antipolis, France, Dec 2003.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.