From Rateless to Hopless

被引:9
作者
Li, Zhenjiang [1 ]
Du, Wan [2 ]
Zheng, Yuanqing [3 ]
Li, Mo [2 ]
Wu, Dapeng [4 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
[3] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
[4] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Rateless codes; wireless networks; routing; USER COOPERATION DIVERSITY; WIRELESS; PERFORMANCE;
D O I
10.1109/TNET.2016.2561304
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a hopless networking paradigm. Incorporating recent techniques of rateless codes, senders break packets into rateless information streams and each single stream automatically adapts to diverse channel qualities at all potential receivers, regardless of their hop distances. The receivers are capable of accumulating rateless information pieces from different senders and jointly decoding the packet, largely improving throughput. We develop a practical protocol, called HOPE, which instantiates the hopless networking paradigm. Compared with the existing opportunistic routing protocol family, HOPE best exploits the wireless channel diversity and takes full advantage of the wireless broadcast effect. HOPE incurs minimum protocol overhead and serves general networking applications. We extensively evaluate the performance of HOPE with indoor network traces collected from USRP N210s and Intel 5300 NICs. The results show that HOPE achieves 1.7x and 1.3x goodput gain over EXOR and MIXIT, respectively. We further implement HOPE on a sensor network testbed, achieving the goodput gains over CTP.
引用
收藏
页码:69 / 82
页数:14
相关论文
共 43 条
[1]  
[Anonymous], P SENSYS
[2]  
Bicket John, 2005, P 11 ANN INT C MOB C, P31
[3]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[4]   Rateless coding for wireless relay channels [J].
Castura, Jeff ;
Mao, Yongyi .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (05) :1638-1642
[5]   Trading structure for randomness in wireless opportunistic routing [J].
Chachulski, Szymon ;
Jennings, Michael ;
Katti, Sachin ;
Katabi, Dina .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :169-180
[6]  
Chang YC, 2016, PROCEEDINGS OF THE IEEE INTERNATIONAL CONFERENCE ON ADVANCED MATERIALS FOR SCIENCE AND ENGINEERING (IEEE-ICAMSE 2016), P1, DOI 10.1109/ICAMSE.2016.7840215
[7]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[8]  
De Couto D. S. J., 2003, P 9 ANN INT C MOB CO, P134, DOI DOI 10.1145/938985.939000
[9]  
Dong W, 2013, IEEE INFOCOM SER, P2679
[10]   Cooperative Transmission for Wireless Networks Using Mutual-Information Accumulation [J].
Draper, Stark C. ;
Liu, Lingjia ;
Molisch, Andreas F. ;
Yedidia, Jonathan S. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) :5151-5162