Cart (Loading....) | Create Account
Close category search window
 

Maximum connectivity and maximum lifetime energy-aware routing for wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pandana, C. ; Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA ; Liu, K.J.R.

In this paper, we consider the energy-aware routing algorithm that explicitly takes into account the connectivity of the sensor networks. In typical sensor network deployment, some nodes may be more important than other nodes because the death of these nodes cause the network disintegration. The network disintegration causes early termination of information delivery. To overcome this problem, we propose a routing algorithm called keep connect algorithm that explicitly considers the connectivity of the network while making the routing decision. The algorithm can be used along with the existing routing algorithms. When doing the routing decision, the keep connect algorithm embeds the importance of the nodes in the routing cost. The importance of a node is quantified by how severe the remaining network becomes disconnected/disintegrated when that particular node dies. In particular, the importance of a node is characterized by the algebraic connectivity of the remaining graph. Compared to the existing routing algorithms, the proposed method achieves up to two times improvement in terms of the network lifetime and the number of successfully delivered packets in the special grid network. In random network, the proposed algorithm achieves 20% improvement of network lifetime, 30% less energy per packet, and 33% more successfully delivered packets.

Published in:

Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE  (Volume:2 )

Date of Conference:

28 Nov.-2 Dec. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.