Vol 2 , Issue 3 , July - September 2014 | Pages: 5-10 | Research Paper
Received: July 20, 2014 | Revised: July 30, 2014 | Accepted: August 20, 2014 | Published Online: September 15, 2014
Author Details
( * ) denotes Corresponding author
A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data. The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. Sensor nodes can be deployed in the harsh environment. As we know that Energy efficient routing is one of the key issues in wireless sensor network because all the nodes are battery powered, so failure of one node affects the entire network that’s why Energy saving is always crucial to the lifetime of a wireless sensor network. Many routing protocols have been proposed to maximize the network lifetime and decrease the energy consumption. But these algorithms do not define how to collect data quickly in efficient way. We proposed an algorithm to provide this service. The main purpose of the proposed algorithm is to reducing the time in the collection process of data in the wireless sensor networks.
Keywords
Wireless Sensor Network; Energy Efficient; Cluster Head; Sub Cluster Head; Data Aggregation; Shortest Path Algorithm; Base Station