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

An efficient scheme for reducing overhead in data-centric storage 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)
XuanTung Hoang ; Korean Adv. Inst. of Sci. & Technol., Daejeon, South Korea ; Younghee Lee

In Data-Centric Storage sensor networks where numerous sensors collaborate to monitor and report occurrences of environmental events, GPSR routing algorithm can be used to route event and query packets efficiently. However, the routing algorithm usually routes packets completely around perimeters enclosing destination locations. In this paper, we show that such perimeter walks cause significant overhead in many practical settings of sensor networks. We then propose an efficient pruning scheme to reduce overhead of perimeter walks. Our algorithm incurs no additional communications overhead; only requires the knowledge of node transmission range; but can significantly reduce overhead of insertions and queries.

Published in:

Communications Letters, IEEE  (Volume:13 ,  Issue: 12 )

Date of Publication:

December 2009

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.