An Efficient Data Aggregation Method for Event-Driven WSNs: A Modeling and Evaluation Approach

Abstract

This paper proposes and models an efficient data aggregation method for wireless sensor networks (WSNs). In the proposed data aggregation method, every cluster head (CH) node incorporates a local forwarding history to decide whether to forward or to drop a recently received packet. When a new packet arrives at a CH node, a threshold value is calculated based on the information of the forwarding history; then, a random number is generated and compared with the threshold value to determine whether the packet should be dropped or not. In fact, the CH node forwards the new packet with the probability of 1 -p and drops it with probability of p where the parameter p is determined based on the forwarding history. In order The submitted manuscript is an extended version of the work previously proposed in [1]. The extensions of the current version include: (1) a wide range of simulation experiments added to the current version. To do this the proposed data aggregation method is compared with previously proposed methods i.e., RAG, SPEED, DASDR, and RDAG is terms of network performance, data aggregation rate, event miss rate. The previous version of the paper does not offer any comparison experiments, (2) an analytical performance model is proposed and validated in the paper. The proposed model estimates network performance, data aggregation rate, event miss rate of WSN using the proposed data aggregation method with an acceptable prediction error. The model provides a remarkable speed up in the evaluation process of data aggregation methods in the field of wireless sensor networks.to evaluate the proposed data aggregation method, two approaches consisting of simulation and analytical modeling are used. Various scenarios are considered in simulations conducted with NS2 software to compare the proposed data aggregation method with four previously proposed methods. Results reveal that the proposed method (1) aggregates more than 70 % of redundant packets, (2) reduces the network end-to-end delay by at least 22 %, and (3) reduces the missed event rate compared with the other methods. The proposed method is also evaluated by means of an analytical model based on queuing networks. The model accurately estimates the network performance utilizing the proposed data aggregation method. Comparisons of the results obtained by the proposed model and simulations confirm that the proposed model has at most 7 % prediction error. The proposed model allows WSN designers to easily achieve useful information about their networks before the establishment and manufacturing of the networks.

SiMple: A Unified Single and Multi-Path Routing Algorithm for Wireless Sensor Networks With Source Location Privacy

“…• There are a total of M stationary sensor nodes in the network which are randomly distributed over the area [32].…”

“…• The envisioned WSN simultaneously experiences eventdriven and query-driven traffic patterns [32], [34].…”

Aggregated Packet Transmission in Duty-Cycled WSNs: Modeling and Performance Evaluation

“…Then unprocessed transmission of such data is likely to waste energy and degrade network performance. Correspondingly, packet aggregation in WSNs has been proposed, mainly from a routing perspective [14], [15], [16], [17], [18]. That is, cluster-heads perform the processing and aggregation of intracluster and inter-cluster information, before it is forwarded towards the sink.…”

Transmission Reliability Evaluation for Wireless Sensor Networks

“…In order to simplify the problem scale, based on two assumptions that (1) wireless sensor node does not have hardware failure and (2) the working environment conforms to the requirements of the premise, we assume that the reliability of the cluster head depended on two factors: node's residual capacity [22][23][24] and forwarding probability [25].…”