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

Energy Efficient and Scalable Search in Dense 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)
Rachuri, K.K. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Madras, Chennai ; Siva Ram Murthy, C.

In this paper, we consider the problem of information discovery in a densely deployed wireless sensor network (WSN), where the initiator of search is unaware of the location of target information. We propose two protocols: increasing ray search (IRS), an energy efficient and scalable search protocol, and k-IRS, an enhanced variant of IRS. The priority of IRS is energy efficiency and sacrifices latency whereas k-IRS is configurable in terms of energy-latency trade-off and this flexibility makes it applicable to varied application scenarios. The basic principle of these protocols is to route the search packet along a set of trajectories called rays that maximizes the likelihood of discovering the target information by consuming least amount of energy. The rays are organized such that if the search packet travels along all these rays, then the entire terrain area will be covered by its transmissions while minimizing the overlap of these transmissions. In this way, only a subset of total sensor nodes transmits the search packet to cover the entire terrain area while others listen. We believe that query resolution based on the principles of area coverage provides a new dimension for conquering the scale of WSN. We compare IRS and k-IRS with existing query resolution techniques for unknown target location such as expanding ring search (ERS), Random walk search, and variants of Gossip search. We show by analysis, simulation, and implementation in testbed that IRS and k-IRS are highly scalable, the cost of search (total number of transmitted bytes) is independent of node density, and it is much lower than that of existing proposals under high node density.

Published in:

Computers, IEEE Transactions on  (Volume:58 ,  Issue: 6 )

Date of Publication:

June 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.