Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Results on finite wireless sensor networks: Connectivity and coverage

Results on finite wireless sensor networks: Connectivity and coverage Results on Finite Wireless Sensor Networks: Connectivity and Coverage ALI ESLAMI, MOHAMMAD NEKOUI, and HOSSEIN PISHRO-NIK, University of Massachusetts, Amherst FARAMARZ FEKRI, Georgia Institute of Technology Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, n, tends to infinity (large-scale networks). The majority of these results have not been extended for small or moderate values of n; whereas in many practical networks, n is not very large. In this article, we consider finite (small-scale) wireless sensor networks. We first show that previous asymptotic results provide poor approximations for such networks. We provide a set of differences between small-scale and large-scale analysis and propose a methodology for analysis of finite sensor networks. Furthermore, we consider two models for such networks: unreliable sensor grids and sensor networks with random node deployment. We provide easily computable expressions for bounds on the coverage and connectivity of these networks. With validation from simulations, we show that the derived analytic expressions give very good estimates of such quantities for finite sensor networks. Our investigation confirms the fact that small-scale networks possess unique characteristics different from their large-scale counterparts, necessitating the http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Sensor Networks (TOSN) Association for Computing Machinery

Results on finite wireless sensor networks: Connectivity and coverage

Download PDF
22 pages

Loading next page...
 
/lp/association-for-computing-machinery/results-on-finite-wireless-sensor-networks-connectivity-and-coverage-e3bwZlbhK3
Publisher
Association for Computing Machinery
Copyright
Copyright © 2013 by ACM Inc.
ISSN
1550-4859
DOI
10.1145/2489253.2489268
Publisher site
See Article on Publisher Site

Abstract

Results on Finite Wireless Sensor Networks: Connectivity and Coverage ALI ESLAMI, MOHAMMAD NEKOUI, and HOSSEIN PISHRO-NIK, University of Massachusetts, Amherst FARAMARZ FEKRI, Georgia Institute of Technology Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, n, tends to infinity (large-scale networks). The majority of these results have not been extended for small or moderate values of n; whereas in many practical networks, n is not very large. In this article, we consider finite (small-scale) wireless sensor networks. We first show that previous asymptotic results provide poor approximations for such networks. We provide a set of differences between small-scale and large-scale analysis and propose a methodology for analysis of finite sensor networks. Furthermore, we consider two models for such networks: unreliable sensor grids and sensor networks with random node deployment. We provide easily computable expressions for bounds on the coverage and connectivity of these networks. With validation from simulations, we show that the derived analytic expressions give very good estimates of such quantities for finite sensor networks. Our investigation confirms the fact that small-scale networks possess unique characteristics different from their large-scale counterparts, necessitating the

Journal

ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery

Published: Jul 1, 2013

There are no references for this article.