Affiliation:
1. Rice University, Houston, TX
2. U.S. Army Research Laboratory, Adelphi, MD
Abstract
In this article, we develop tractable mathematical models and approximate solution algorithms for a class of integer optimization problems with probabilistic and deterministic constraints, with applications to the design of distributed sensor networks that have limited connectivity. For a given deployment region size, we calculate the Pareto frontier of the sensor network utility at the desired probabilities for
d
-connectivity and
k
-coverage. As a result of our analysis, we determine (1) the number of sensors of different types to deploy from a sensor pool, which offers a cost vs. performance trade-off for each type of sensor, (2) the minimum required radio transmission ranges of the sensors to ensure connectivity, and (3) the lifetime of the sensor network. For generality, we consider randomly deployed sensor networks and formulate constrained optimization technique to obtain the localization performance. The approach is guided and validated using an unattended acoustic sensor network design. Finally, approximations of the complete statistical characterization of the acoustic sensor networks are given, which enable average network performance predictions of any combination of acoustic sensors.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference49 articles.
1. A survey on sensor networks
2. Explicit Ziv-Zakai lower bound for bearing estimation
3. Berger J. 1993. Statistical Decision Theory and Bayesian Analysis. Springer. Berger J. 1993. Statistical Decision Theory and Bayesian Analysis. Springer.
4. Bertsekas D. P. 2003. Nonlinear Programming. Athena Scientific. Bertsekas D. P. 2003. Nonlinear Programming. Athena Scientific.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献