Power efficient data gathering and aggregation in wireless sensor networks

Recent developments in processor, memory and radio technology have enabled wireless sensor networks which are deployed to collect useful information from an area of interest The sensed data must be gathered and transmitted to a base station where it is further processed for end-user queries. Since the network consists of low-cost nodes with limited battery power, power efficient methods must be employed for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in a round of communication each of the sensor nodes has data to send to a base station, it is important to minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be achieved in terms of network lifetime. So far, besides the conventional protocol of direct transmission, two elegant protocols called LEACH and PEGASIS have been proposed to maximize the lifetime of a sensor network. In this paper, we propose two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other. Our simulation results show that our algorithms perform well both in systems where base station is far away from and where it is in the center of the field. PEDAP achieves between 4x to 20x improvement in network lifetime compared with LEACH, and about three times improvement compared with PEGASIS

Implementation of Load Balanced Data Gathering of Nodes in Wireless Sensor Network

Data Gathering is a basic task in Wireless Sensor Networks (WSNs). Data gathering trees capable of performing aggregation operations are also referred to as Data Aggregation Trees (DATs). Recent work focus on constructing DATs according to different user requirements under the Deterministic Network Model (DNM). However, due to the existence of many probabilistic empty links in WSNs, it is more practical to obtain a DAT under the realistic Probabilistic Network Model (PNM). Moreover, the load-balance factor is neglected when constructing DATs in current literatures. Therefore, it is focused on constructing a Load-Balanced Data Aggregation Tree (LBDAT) under the PNM.In this paper, we did simulation of the same as above stated WSN in NS2 network simulator. DOI: 10.17762/ijritcc2321-8169.15081

TABU Search Based Cluster Head Selection in Stable Election Protocol

The clustering in the Wireless Sensor Networks (WSN) is one of the most important investigation areas. There are many cluster head selection algorithms which were developed before today. Tabu search based algorithms is developed to reduce the energy consumption and enhance the WSN life-time. The comparison is done among the SEP ,D-SEP,M-SEP and TABU based SEP in the wireless sensor network. The planned technique has the flexibility to beat the constraints of the SEP routing protocol by pattern clump and TABU search. The comparison square measure drawn among the current and planned techniques. The comparisons has clearly shown that the planned technique outperforms over the on the market technique

Tree Based Energy Balancing Routing Protocol by Self Organizing in Wireless Sensor Networks

Today the wireless sensor networks (WSN) play a crucial role in wireless technology in various domains like military, medicine, communications etc. The energy conservation is the crucial factor in the WSN. The WSN is a system which has more number of nodes in which various sensors are fabricated on the nodes to monitor various factors of the given task. These nodes will form a network by connecting the one to other for the effective communication between the nodes, and sends the whole information to the base station (BS). As the nodes which we use for the WSN are of low cost and are battery operated. The main drawback is replacement of the battery in the WSN. The main goal is to conserve the energy consumption in WSN and also to balance the load on WSN. For this many protocols are designed like LEACH, PEGASIS, PEDAP, etc. in those balancing the load and time delayed. some drawbacks are there. So we proposed a protocol so called “Tree Based Energy Balancing routing Protocol by Self Organizing” (TEBRSO), in which instead of routing tables a routing tree will be used for routing from nodes to base station (BS), which chooses one root/control node for the broadcasting messages to the selected sensor nodes. By this protocol we can save the energy consumption in WSN and can extend the life time of it. The performance of this protocol is better when we compare with other energy saving protocols

Evaluating The Shortcomings Of DEEC VariantsÂ

No Abstrac

Performance evaluation of CCM and TSCP routing protocols within/without data fusing in WSNs

Wireless Sensor Network (WSN) is a large number of small sensor devices that can connect each other wirelessly.WSNs applications are rapidly growing in last decades, furthermore, in WSN research, energy is one of the important issues that must consider when designing a new protocol. Due to the fact, almost all of nodes' energy deplete in the communication part, and the data fusing directly impact the performance of routing protocol.This paper studies the impact of data fusing for chain based routing protocols.In this study, ns-3 simulator used to evaluate Chain-Cluster Mixed (CCM) and Two Stage Chain Protocol (TSCP) routing protocols with deterministic nodes deployment. The experiments show that TSCP overcomes CCM in network lifetime when data fusing applied while CCM overcomes TSCP in the same metric with non-fusing of data for First Node Die (FND), 10%, 25%, 50% and Last node (LND). Furthermore, CCM is still playing a good behavior in delay for both approaches. The main conclusion for this paper is non-fusing of data must be applied when design new routing protocol to study all the packets traffic behaviors in the path from source to destination

Energy Efficient Ant Colony Algorithms for Data Aggregation in Wireless Sensor Networks

In this paper, a family of ant colony algorithms called DAACA for data aggregation has been presented which contains three phases: the initialization, packet transmission and operations on pheromones. After initialization, each node estimates the remaining energy and the amount of pheromones to compute the probabilities used for dynamically selecting the next hop. After certain rounds of transmissions, the pheromones adjustment is performed periodically, which combines the advantages of both global and local pheromones adjustment for evaporating or depositing pheromones. Four different pheromones adjustment strategies are designed to achieve the global optimal network lifetime, namely Basic-DAACA, ES-DAACA, MM-DAACA and ACS-DAACA. Compared with some other data aggregation algorithms, DAACA shows higher superiority on average degree of nodes, energy efficiency, prolonging the network lifetime, computation complexity and success ratio of one hop transmission. At last we analyze the characteristic of DAACA in the aspects of robustness, fault tolerance and scalability.Comment: To appear in Journal of Computer and System Science