OLDA: An Efficient On-Line Data Aggregation Method for Wireless Sensor Networks

Abstract

Sending and receiving redundant packets inWireless Sensor Networks (WSN), increase the congestion ratio as well as energy consumption in WSNs. In this regard, several data aggregation methods for WSNs have been presented to identify and to aggregate redundant packets. In this paper, we present an efficient on-line data aggregation method, OLDA, for real-time WSNs. OLDA method assigns different priorities to different events to help Cluster Head (CH) nodes in making an appropriate decision about the packet i.e., forwarding or aggregation. Indeed, CH nodes send newly received packet with probability െ and remove it with probability . Since the parameter is proportional to time and location of the occurred event, OLDA method, tends to forward packets of newly occurred events i.e., is close to 0 here. When more time is passed parameter is gradually increased; hence OLDA method tends to drop packets. Experimental results by the use of NS2 simulator show that OLDA method effectively reduces the miss rate compared with DASDR and RDAG aggregation methods. Also, OLDA method aggregates more than 70% of redundant packets and reduces the network end-to-end delay compared with RAG and SPEED methods.

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

“…This area which is called coverage range, S c , for a given sensor node can be calculated by Algorithm 3. With the success ratio shown in Equation (11), we can use Equation (12) to calculate the probability of having r sensor nodes in the coverage range and Equation (13) gives the expected number of sensor nodes within the area: where S c is the coverage range of the activated sensor node and is determined according to the regional configuration depicted in Figure 3. Figure 4, packet forwarding in the intermediate area expands the coverage range of the sensor nodes.…”

“…In [13], an algorithm has been proposed in which the intermediate nodes are capable of eliminating redundant packets/ reports on their way from the sensor nodes toward the BS. Redundant reports are identified and eliminated based on the arrival time of the packets.…”

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

“…Packets, after arriving to a CH node, are placed into an input buffer up until the forwarding time. At the time of forwarding, the packet is transferred into the output buffer with the probability of 1 -p. The CH node does not always send the packet and instead aggregates it with the probability of p [1].…”

“…Wireless sensor networks (WSNs) have been recently regarded as one of the emerging technologies that will change the world [1,2]. In recent years, WSNs play an important role in several aspects of human life such as environmental monitoring [3], real-time target tracking [4], multimedia [5], structural monitoring [6] and health care [7] due to their low cost of design, rapid development, high flexibility and ease of implementation.…”

“…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.…”