bullet Sensors & Transducers Journal

    (ISSN 1726- 5479)

205.767

2008 e-Impact Factor

25 Top Downloaded Articles

Best Selling Articles 2012

Journal Subscription 2013

Editorial Calendar 2013

Submit an Article

Editorial Board

Current Issue

S&T journal's cover

Sensors & Transducers Journal 2011

Sensors & Transducers Journal 2010

Sensors & Transducers Journal 2009

Sensors & Transducers Journal 2008

Sensors & Transducers Journal 2007

2000-2002 S&T e-Digest Contents

2003 S&T e-Digest Contents

2004 S&T e-Digest Contents

2005 S&T e-Digest Contents

2006 S&T e-Digest Contents

 

Best Articles 2011

 

 

 

Vol. 158, Issue 11, November 2013, pp. 113-119

 

Bullet

 

Energy Efficient Least Spanning Routing Tree Algorithm Based on Virtual Grid in Wireless Sensor Networks
 
Jinxue ZHANG, Ming ZHANG

College of Electronic Engineering, Huaihai Institute of Technology, Jiangsu, 222005, China
Tel.: +86-13003467058
E-mail: lyg690916@163.com

 

Received: 1 August 2013   /Accepted: 25 October 2013   /Published: 30 November 2013

Digital Sensors and Sensor Sysstems

 

Abstract: Due to the limitation of energy resources, energy efficiency is a key issue in wireless sensor networks (WSNs). Clustering or shortest routing are proved to be an important way to improve the scalability and prolong the lifetime of wireless sensor networks, but rarely consider the energy efficient and the shortest path at the same time. In this paper, we propose an energy efficient least spanning routing tree algorithm (EELSRT) based on clustering and virtual grid ideas to prolong network lifetime and shorten path while emphasizing energy conservation at the same time. Selecting cluster head includes initialization stage ,dynamic selecting active node and dynamic selecting head stage, namely, partitions the whole network to many cluster and divides each cluster into N?N grid which there is only one active node and others are sleeping, the active node is responsible for receiving, sending and updating table in its grid ,the cluster head is dynamic generates from all active nodes, head is responsible for receiving, sending and maintaining information in its cluster. Then all cluster heads dynamic constructs a least spanning routing tree to prolong network lifetime, save energy and shorten path. Simulation results show that the performance of EELSR on lifetime and energy consumption have further improved by using clustering and least spanning tree, It is a promising approach and deserves more future research.

 

Keywords: Wireless sensor networks (WSN), Energy efficient, Least spanning tree, Routing algorithm, Virtual grid.

 

 

Buy this article online (it will be send to you in the pdf format by e-mail) or subscribe Sensors & Transducers journal

(12 issues per year plus special issues; 40 % discount for payment IFSA Members):

 

 

Sensors & Transducers journal subscription

450 $ US per year:

 

Buy this article for
14.95 $ US:

 

 
 

 

 
 

Alternatively we accept a money transfer to our bank account. Please contact for details: sales@sensorsportal.com

 

Download <here> the Library Journal Recommendation Form

 

 

Read more about Wireless Sensor Networks

 

 

 

 

 


1999 - 2013 Copyright , International Frequency Sensor Association (IFSA). All Rights Reserved.


Home - News - Links - Archives - Tools - Voltage-to-Frequency Converters - Standardization - Patents - Marketplace - Projects - Wish List - e-Shop - Sensor Jobs - Membership - Videos - Publishing - Site Map - Subscribe - Search

 Members Area -Sensors Portal -Training Courses - S&T Digest - For advertisers - Bookstore - Forums - Polls - Submit Press Release - Submit White Paper - Testimonies - Twitter - Facebook - LinkedIn