Energy-efficient search for finite-lifetime resources in sensor networks with time-constrained queries

Authors:
Christopher R. Mann;Rusty O. Baldwin;Jeffrey P. Kharoufeh;Barry E. Mullins
Affiliations:
Air Force Institute of Technology, Wright-Patterson Air Force Base, OH;Air Force Institute of Technology, Wright-Patterson Air Force Base, OH;Northeastern University, Boston, MA;Air Force Institute of Technology, Wright-Patterson Air Force Base, OH
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review
Year:
2008

Citing 12
Cited 0

Rumor routing algorthim for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GHT: a geographic hash table for data-centric storage

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Data-centric storage in sensornets

ACM SIGCOMM Computer Communication Review
Data-centric storage in sensornets with GHT, a geographic hash table

Mobile Networks and Applications
Zonal Rumor Routing for Wireless Sensor Networks

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Comparing and Evaluating Lightweight Solutions for Replica Dissemination and Retrieval in Dense MANETs

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Straight Line Routing for Wireless Sensor Networks

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Octopus: A Fault-Tolerant and Ef.cient Ad-hoc Routing Protocol

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Energy-efficient, collision-free medium access control for wireless sensor networks

Wireless Networks
A queueing approach to optimal resource replication in wireless sensor networks

Performance Evaluation
Energy efficient protocols for information dissemination in wireless sensor networks

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the performance of a random-walk search algorithm for wireless sensor networks when resources are subject to limited lifetimes and queries are constrained by application-specific deadlines. Specifically, via the time-to-live and transmission range parameters, we estimate the appropriate number of resource copies that must be created within the network to minimize the total node arrival rate (the energy-centric approach) or to ensure the total proportion of queries failures does not exceed a specified threshold (the failure-centric approach). The effect of node transmission range on network performance is also investigated. We compare the results of our network simulations to our queueing-based analytic node model and find that there is an inverse relationship between transmission range and the time-to-live value required to minimize the total node arrival rate.