An Efficient and Provable Routing Approach for In-Network Aggregation in Wireless Sensor Networks

Ancy Rajan

Abstract: Wireless Sensor Networks (WSNs) is a class of wireless ad hoc networks in which sensor nodes collect, process, and communicate data acquired from the physical environment to an external Base-Station (BS). But the fundamental challenge in the design of Wireless Sensor Networks (WSNs) is to maximize their lifetimes especially when they have a limited and non-replenishable energy supply. To increase the lifetime of the sensor network, power management and energy-efficient communication techniques at all layers become necessary. In this paper, we present solutions for the data gathering and routing problem with in network aggregation in WSNs. This paper focuses on the maximum lifetime data gathering and routing without packet loss in wireless sensor networks Our objective is to maximize the network lifetime by utilizing data aggregation and in network processing techniques.

Keywords: Data aggregation, data-centric routing, packet resensing algorithm, wireless sensor networks.

Title: An Efficient and Provable Routing Approach for In-Network Aggregation in Wireless Sensor Networks

Author: Ancy Rajan

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Vol. 3, Issue 2, April 2015 - June 2015

Citation
Share : Facebook Twitter Linked In

Citation
An Efficient and Provable Routing Approach for In-Network Aggregation in Wireless Sensor Networks by Ancy Rajan