Optimal Node Density for Detection in Energy-Constrained Random Networks
暂无分享,去创建一个
[1] H. Vincent Poor,et al. Detection of Stochastic Processes , 1998, IEEE Trans. Inf. Theory.
[2] Moe Z. Win,et al. Data Fusion Trees for Detection: Does Architecture Matter? , 2008, IEEE Transactions on Information Theory.
[3] Ananthram Swami,et al. Detection of Gauss–Markov Random Fields With Nearest-Neighbor Dependency , 2007, IEEE Transactions on Information Theory.
[4] Panganamala Ramana Kumar,et al. Toward a theory of in-network computation in wireless sensor networks , 2006, IEEE Communications Magazine.
[5] Mingyan Liu,et al. On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.
[6] Leonhard Held,et al. Gaussian Markov Random Fields: Theory and Applications , 2005 .
[7] J. Besag. Statistical Analysis of Non-Lattice Data , 1975 .
[8] Robert Haining,et al. Statistics for spatial data: by Noel Cressie, 1991, John Wiley & Sons, New York, 900 p., ISBN 0-471-84336-9, US $89.95 , 1993 .
[9] Ananthram Swami,et al. Cost-performance tradeoff in multi-hop aggregation for statistical inference , 2008, 2008 IEEE International Symposium on Information Theory.
[10] George Michailidis,et al. Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks , 2008, IEEE Transactions on Signal Processing.
[11] Mike Rees,et al. 5. Statistics for Spatial Data , 1993 .
[12] Pramod K. Varshney,et al. Data-aggregation techniques in sensor networks: a survey , 2006, IEEE Communications Surveys & Tutorials.
[13] Anthony Ephremides,et al. Energy concerns in wireless networks , 2002, IEEE Wirel. Commun..
[14] Ananthram Swami,et al. Minimum Cost Data Aggregation with Localized Processing for Statistical Inference , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[15] J. Yukich,et al. Limit theory for random sequential packing and deposition , 2002 .
[16] J. Yukich,et al. Weak laws of large numbers in geometric probability , 2003 .
[17] Lang Tong,et al. Cooperative routing for distributed detection in large sensor networks , 2007, IEEE Journal on Selected Areas in Communications.
[18] L. Tong,et al. Detection of Gauss-Markov Random Fields under Routing Energy Constraint , 2007 .
[19] J. Steele. Probability theory and combinatorial optimization , 1987 .
[20] Ramesh Govindan,et al. The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.
[21] Alan S. Willsky,et al. Inference with Minimal Communication: a Decision-Theoretic Variational Approach , 2005, NIPS.
[22] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[23] Nikhil Balram,et al. Recursive structure of noncausal Gauss-Markov random fields , 1992, IEEE Trans. Inf. Theory.
[24] Martin Vetterli,et al. On the optimal density for real-time data gathering of spatio-temporal processes in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..
[25] J. Møller,et al. Statistical Inference and Simulation for Spatial Point Processes , 2003 .
[26] Martin J. Wainwright,et al. Graphical Models and Fusion in Sensor Networks , 2007 .
[27] Moe Z. Win,et al. On the Subexponential Decay of Detection Error Probabilities in Long Tandems , 2008, IEEE Trans. Inf. Theory.
[28] Douglas L. Jones,et al. Energy-efficient detection in sensor networks , 2005, IEEE Journal on Selected Areas in Communications.
[29] J. Besag. Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .
[30] S. Varadhan,et al. Large deviations for stationary Gaussian processes , 1985 .
[31] Venugopal V. Veeravalli,et al. How Dense Should a Sensor Network Be for Detection With Correlated Observations? , 2006, IEEE Transactions on Information Theory.
[32] A. Ephremides,et al. Energy-driven detection scheme with guaranteed accuracy , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[33] Mohamed F. Younis,et al. A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.
[34] Cyrus Shahabi,et al. The Clustered AGgregation (CAG) technique leveraging spatial and temporal correlations in wireless sensor networks , 2007, TOSN.
[35] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[36] J. Yukich,et al. Central limit theorems for some graphs in computational geometry , 2001 .
[37] Mario Cortina-Borja,et al. Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges , 2000 .
[38] Ahmed Helmy,et al. RUGGED: RoUting on finGerprint Gradients in sEnsor Networks , 2004, The IEEE/ACS International Conference on Pervasive Services.
[39] Po-Ning Chen. General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds , 1996, IEEE Trans. Inf. Theory.
[40] Rick S. Blum,et al. Energy-efficient Routing for Signal Detection under the Neyman-Pearson Criterion in Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.
[41] Ananthram Swami,et al. Energy Efficient Routing for Statistical Inference of Markov Random Fields , 2007, 2007 41st Annual Conference on Information Sciences and Systems.