Flexible Congestion Management for Error Reduction in Wireless Sensor Networks
暂无分享,去创建一个
[1] Michael R. Lyu,et al. PORT: a price-oriented reliable transport protocol for wireless sensor networks , 2005, 16th IEEE International Symposium on Software Reliability Engineering (ISSRE'05).
[2] Kai Han,et al. Energy-efficient reliable data dissemination in duty-cycled wireless sensor networks , 2013, MobiHoc.
[3] Chieh-Yih Wan,et al. CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.
[4] Lei Yu,et al. Congestion-adaptive data collection with accuracy guarantee in cyber-physical systems , 2015, 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).
[5] Jun Sun,et al. Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.
[6] Alan M. Frieze,et al. Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.
[7] Frederick R. Forst,et al. On robust estimation of the location parameter , 1980 .
[8] Jun Yang,et al. Constraint chaining: on energy-efficient continuous monitoring in sensor networks , 2006, SIGMOD Conference.
[9] Ramesh Govindan,et al. Quasi-static Centralized Rate Allocation for Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.
[10] Baltasar Beferull-Lozano,et al. On network correlated data gathering , 2004, IEEE INFOCOM 2004.
[11] A. P. Williams,et al. Impact of anthropogenic climate change on wildfire across western US forests , 2016, Proceedings of the National Academy of Sciences.
[12] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[13] Yan Gao,et al. Towards optimal rate allocation for data aggregation in wireless sensor networks , 2011, MobiHoc '11.
[14] Haizhou Wang,et al. Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming , 2011, R J..
[15] Lei Yu,et al. Data Collection with Accuracy-Aware Congestion Control in Sensor Networks , 2019, IEEE Transactions on Mobile Computing.
[16] Özgür B. Akan,et al. ESRT: event-to-sink reliable transport in wireless sensor networks , 2003, MobiHoc '03.
[17] Huang Lee,et al. Towards Energy-Optimal and Reliable Data Collection via Collision-Free Scheduling in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[18] Sartaj Sahni,et al. An online heuristic for maximum lifetime routing in wireless sensor networks , 2006, IEEE Transactions on Computers.
[19] Sariel Har-Peled,et al. How Fast Is the k-Means Method? , 2005, SODA '05.
[20] Christos G. Cassandras,et al. On maximum lifetime routing in Wireless Sensor Networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.
[21] Xiaohua Jia,et al. Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.
[22] Yuan He,et al. Adaptive Approximate Data Collection for Wireless Sensor Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.
[23] Ramesh Govindan,et al. RCRT: Rate-controlled reliable transport protocol for wireless sensor networks , 2010, TOSN.
[24] T. Başar,et al. A New Approach to Linear Filtering and Prediction Problems , 2001 .
[25] David M. Mount,et al. A local search approximation algorithm for k-means clustering , 2002, SCG '02.
[26] Vishnu Navda,et al. Efficient gathering of correlated data in sensor networks , 2008, TOSN.