An Optimized Degree Strategy for Persistent Sensor Network Data Distribution
暂无分享,去创建一个
[1] Lihao Xu,et al. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).
[2] Zhen Liu,et al. Maximizing the Data Utility of a Data Archiving & Querying System through Joint Coding and Scheduling , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.
[3] Thomas E. Fuja,et al. Distributed LT Codes , 2006, 2006 IEEE International Symposium on Information Theory.
[4] Jianer Chen,et al. An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks , 2010, 2010 IEEE International Conference on Communications.
[5] Ness B. Shroff,et al. On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[6] Jörg Kliewer,et al. On the Performance of Distributed LT Codes , 2006 .
[7] Baochun Li,et al. Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[8] Saejoon Kim,et al. Improved intermediate performance of rateless codes , 2009, 2009 11th International Conference on Advanced Communication Technology.
[9] Francesco Chiti,et al. Contaminated areas monitoring via distributed rateless coding with constrained data gathering , 2010, IWCMC.
[10] Anxiao Jiang. Network Coding for Joint Storage and Transmission with Minimum Cost , 2006, 2006 IEEE International Symposium on Information Theory.
[11] James S. Plank,et al. A practical analysis of low-density parity-check erasure codes for wide-area storage applications , 2004, International Conference on Dependable Systems and Networks, 2004.
[12] Alexandros G. Dimakis,et al. Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[13] Yunnan Wu,et al. Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.
[14] Sachin Agarwal,et al. Rateless Coding with Feedback , 2009, IEEE INFOCOM 2009.
[15] Jon Feldman,et al. Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM.
[16] Emina Soljanin,et al. Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).
[17] Jörg Widmer,et al. Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.
[18] Nazanin Rahnavard,et al. Efficient symbol sorting for high intermediate recovery rate of LT codes , 2010, 2010 IEEE International Symposium on Information Theory.
[19] Jie Gao,et al. In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection , 2010, ALGOSENSORS.
[20] Jon Feldman,et al. Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM 2006.
[21] Francesco Chiti,et al. A Packet-Centric Approach to Distributed Rateless Coding in Wireless Sensor Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.
[22] Vinod M. Prabhakaran,et al. Distributed Fountain Codes for Networked Storage , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.