Symbol-level network coding for wireless mesh networks

被引:106
作者
Katti, Sachin [1 ]
Katabi, Dina [1 ]
Balakrishnan, Hari [1 ]
Medard, Muriel [1 ]
机构
[1] MIT, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
algorithms; design; performance; theory;
D O I
10.1145/1402946.1403004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes MIXIT, a system that improves the throughput of wireless mesh networks. MIXIT exploits a basic property of mesh networks: even when no node receives a packet correctly, any given bit is likely to be received by some node correctly. Instead of insisting on forwarding only correct packets, MIXIT routers use physical layer hints to make their best guess about which bits in a corrupted packet are likely correct and forward them to the destination. Even though this approach inevitably lets erroneous bits through, we show that it achieves high throughput without compromising end-to-end reliability. The core component of MIXIT is a novel network code that operates on small groups of bits, called symbols. It allows the nodes to opportunistically route correctly-received bits to their destination with low overhead. MIXIT's network code also incorporates an end-to-end error correction component that the destination uses to correct any errors that might seep through. We have implemented MIXIT on a software radio platform running the Zigbee radio protocol. Our experiments on a 25-node indoor testbed show that MIXIT has a throughput gain of 2.8 x over MORE, a state-of-the-art opportunistic routing scheme, and about 3.9 x over traditional routing using the ETX metric.
引用
收藏
页码:401 / 412
页数:12
相关论文
共 30 条
[1]  
[Anonymous], IEEE T IND ELECT
[2]  
BISWAS S, 2005, ACM SIGCOMM PHIL US
[3]  
Chachulski S, 2007, ACM SIGCOMM KYOT JAP
[4]  
GABIDULIN EM, 1985, PROBL INFORM TRANSM, P1
[5]  
HAGENAUER J, 1989, IEEE GLOBECOM DALL U
[6]  
Ho T., 2003, ISIT YOK JAP
[7]  
INC E, UNIVERSAL SOFTWARE R
[8]  
JAGGI S, 2007, IEEE INFOCOM AL US
[9]  
Jamieson K., 2007, ACM SIGCOMM KYOT JAP
[10]  
Katti S., 2008, THESIS MIT