Abstrait

Data Aggregation Scheme for Dynamic Routing Using PBDR in Wireless Sensor Networks

Ram kumar.R, Vijayalakshmi.B,Revathi.S

The fundamental challenge in design of wireless sensor network is to enhance the network lifetime. Many factors are taken into account for the maximization of life time of wireless sensor networks, such as minimizing the power consumption, low cost operation, optimal routing algorithms. Sensor nodes have much redundancy and data aggregation that becomes a productive procedure to eradicate the redundancy. It minimizes the number of transmissions and hence it saves power. The Packets that are generated by heterogeneous sensors or different submissions have different attributes. Packets from different submissions could not be aggregated. The data aggregation scheme uses static routing protocols that do not forward the packets dynamically according to network state or packet types. The spatial isolation initiated by static routing protocol is unfavorable to data aggregation .The concept of packet attribute, defined as the identifier of the data tried by different types of sensors or submissions suggest an Attribute-aware Data Aggregation (ADA) scheme consisting of a packet-driven timing algorithm with special Dynamic routing protocol and Potential-Based Dynamic Routing that is elaborated to support an ADA scheme which improves the efficiency of Data Aggregation.