[1] |
刘伟, 刘军 . 时延敏感传感器网络中分布式动态资源管理研究[J]. 通信学报, 2017,38(7): 70-77.
|
|
LIU W , LIU J . Study on distributed and dynamic resource management for delay-sensitive sensor network[J]. Journal on Communications, 2017,38(7): 70-77.
|
[2] |
CHEN L Y , GU Y , GUO S ,et al. Group-based discovery in low-duty-cycle mobile sensor networks[C]// 2012 9th Annual IEEE Communications Society Conference on Sensor,Mesh and Ad Hoc Communications and Networks (SECON). 2012: 542-550.
|
[3] |
LUBY M , . LT codes[C]// The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002). 2002: 271-280.
|
[4] |
ACEDANSKI S , DEB S , MEDARD M ,et al. How good is random linear coding based distributed networked storage[C]// First Workshop on Network Coding,Theory,and Applications (NetCod 2005). 2005: 1-6.
|
[5] |
KAMRA A , MISRA V , FELDMAN J ,et al. Growth codes:maximizing sensor network data persistence[C]// The 2006 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications (SIGCOMM 2006). 2006: 1-12.
|
[6] |
LIN Y F , LI B C , LIANG B . Differentiated data persistence with priority random linear codes[C]// 27th International Conference on Distributed Computing Systems (ICDCS 2007). 2007: 47-54.
|
[7] |
LIN Y F , LIANG B , LI B C . Geometric random linear codes in sensor networks[C]// 2008 IEEE International Conference on Communications (ICC 2008). 2008: 2298-2303.
|
[8] |
MATSUZONO K , ROCA V , ASAEDA H . Structured random linear codes (SRLC):bridging the gap between block and convolutional codes[C]// 2014 IEEE Global Communications Conference (Globecom 2014). 2014: 1211-1217.
|
[9] |
AL-AWAMI L , HASSANEIN H . Distributed data storage systems for data survivability in wireless sensor networks using decentralized erasure codes[J]. Computer Networks, 2016,97(3): 113-127.
|
[10] |
TALARI A , RAHNAVARD N . CStorage:decentralized compressive data storage in wireless sensor networks[J]. Ad Hoc Networks, 2016,37(2): 475-485.
|
[11] |
LIN Y F , LIANG B , LI B . Data persistence in large-scale sensor networks with decentralized fountain codes[C]// 26th IEEE International Conference on Computer Communications (INFOCOM 2007). 2007: 1658-1666.
|
[12] |
KONG Z , ALY S , SOLJANIN E . Decentralized coding algorithms for distributed storage in wireless sensor networks[J]. IEEE Journal on Selected Areas in Communications, 2010,28(2): 261-267.
|
[13] |
LIU K K , EL-KHAMY M , LEE J . Finite-length algebraic spatially-coupled quasi-cyclic LDPC codes[J]. IEEE Journal on Selected Areas in Communications, 2016,34(2): 329-344.
|
[14] |
AL-AWAMI L , HASSANEIN H . Robust decentralized data storage and retrieval for wireless networks[J]. Computer Networks, 2017,128(9): 41-50.
|
[15] |
KONB B , ZHANG G , ZHANG W ,et al. Data persistence in planetary surface network using raptor codes and probabilistic broadcasting[J]. International Journal of Distributed Sensor Networks, 2016,12(10): 1-13.
|
[16] |
AZIMI N H , GUPTA H , HOU X X ,et al. Data preservation under spatial failures in sensor networks[C]// The Eleventh ACM International Symposium on Mobile Ad Hoc Networking and Ccomputing (MobiHoc 2010). 2010: 171-180.
|
[17] |
XU M , SONG W Z , HEO D ,et al. ECPC:preserve downtime data persistence in disruptive sensor networks[C]// 2013 IEEE 10th International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2013). 2013: 281-289.
|
[18] |
梁俊斌, 李陶深 . 无线传感网中基于自适应概率广播的数据保存[J]. 计算机研究与发展, 2012,49(10): 2229-2240.
|
|
LIANG J B , LI T S . An adaptive probability broadcast-based data preservation in wireless sensor networks[J]. Journal of Computer Research and Development, 2012,49(10): 2229-2240.
|
[19] |
KONB B , ZHANG G X , ZHANG W ,et al. Efficient distributed storage for space information network based on fountain codes and probabilistic broadcasting[J]. KSII Transactions on Internet and Information Systems, 2016,10(6): 2606-2626.
|
[20] |
RUIZ P , BOUVRY P . Survey on broadcast algorithms for mobile ad hoc networks[J]. ACM Computing Surveys, 2015,48(1): 1-35.
|
[21] |
CHEN L Y , SHU Y C , GU Y ,et al. Group-based neighbor discovery in low-duty-cycle mobile sensor networks[J]. IEEE Transactions on Mobile Computing, 2016,15(8): 1996-2009.
|
[22] |
CHEN P P , CHEN Y , GAO S ,et al. Efficient group-based discovery for wireless sensor networks[J]. International Journal of Distributed Sensor Networks, 2017,13(7): 1-12.
|
[23] |
CHAKCHOUK N . A survey on opportunistic routing in wireless communication networks[J]. IEEE Communications Surveys & Tutorials, 2015,17(4): 2214-2241.
|
[24] |
SO J M , BYUN H J . Load-balanced opportunistic routing for duty-cycled wireless sensor networks[J]. IEEE Transactions on Mobile Computing, 2017,16(7): 1940-1955.
|
[25] |
CAMP T , BOLENG J , DAVIES V . A survey of mobility models for ad hoc network research[J]. Wireless Communications and Mobile Computing, 2002,2(5): 483-502.
|
[26] |
WU Y , MAO Z J , FAHMY S ,et al. Constructing maximum-lifetime data-gathering forests in sensor networks[J]. IEEE/ACM Transactions on Networking, 2010,18(5): 1571-1584.
|
[27] |
KUI X Y , ZHANG S G , WANG J X ,et al. An energy-balanced clustering protocol based on dominating set for data gathering in wireless sensor networks[C]// 2012 IEEE International Conference on Communications (ICC). 2012: 193-197.
|
[28] |
MIAO G W , AZARI A , HWANG T W . E2-MAC:energy efficient medium access for massive M2M communications[J]. IEEE Transactions on Communications, 2016,64(11): 4720-4735.
|
[29] |
GROENEVELT R , NAIN P , KOOLE G . The message delay in mobile ad hoc networks[J]. Performance Evaluation, 2005,62(1-4): 210-228.
|