Hop-distance estimation in wireless sensor networks with applications to resources allocation

21Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We address a fundamental problem in wireless sensor networks, how many hops does it take a packet to be relayed for a given distance? For a deterministic topology, this hop-distance estimation reduces to a simple geometry problem.However, a statistical study is needed for randomly deployed WSNs. We propose a maximum-likelihood decision based on the conditional pdf of f( r| Hi) . Due to the computational complexity of f( r| Hi), we also propose an attenuated Gaussian approximation for the conditional pdf. We show that the approximation visibly simplifies the decision process and the error analysis. The latency and energy consumption estimation are also included as application examples. Simulations show that our approximation model can predict the latency and energy consumption with less than half RMSE, compared to the linear models.

Cite

CITATION STYLE

APA

Zhao, L., & Liang, Q. (2007). Hop-distance estimation in wireless sensor networks with applications to resources allocation. Eurasip Journal on Wireless Communications and Networking, 2007. https://doi.org/10.1155/2007/84256

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free