Acoustic Sensor Network Design for Position Estimation

被引:18
作者
Cevher, Volkan [1 ]
Kaplan, Lance M. [2 ]
机构
[1] Rice Univ, Houston, TX 77005 USA
[2] USA, Res Lab, Adelphi, MD 20783 USA
关键词
Algorithms; Design; Performance; Bayesian experimental design; dynamic programming; sensor networks; DELAY ESTIMATION;
D O I
10.1145/1525856.1525859
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1 / 28
页数:28
相关论文
共 48 条
  • [1] A survey on sensor networks
    Akyildiz, IF
    Su, WL
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) : 102 - 114
  • [2] ALTMAN E, 2005, P C COMM INFOCOM, V1
  • [3] [Anonymous], 2003, NONLINEAR PROGRAMMIN
  • [4] Explicit Ziv-Zakai lower bound for bearing estimation
    Bell, KL
    Ephraim, Y
    VanTrees, HL
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1996, 44 (11) : 2810 - 2824
  • [5] Berger J.O., 1993, STAT DECISION THEORY
  • [6] BETTSTETTER C, 2002, P 3 ACM INT S MOB AD, P80, DOI DOI 10.1145/513800.513811
  • [7] BHARDWAJ M, 2001, IEEE INT C COMM, V3
  • [8] BHARDWAJ M, 2002, P C COMM INFOCOM, V3
  • [9] Bollobas B., 1998, MODERN GRAPH THEORY
  • [10] Boyd Stephen, 2004, Convex Optimization, DOI DOI 10.1017/CBO9780511804441