The application of network coding to multicast routing in wireless networks

This thesis considers the application of network coding and opportunistic routing to improve the performance of multicast flows in wireless networks. Network coding allows routers to randomly mix packets before forwarding them. This randomness ensures that routers that hear the same transmission are unlikely to forward the same packets, which permits routers to exploit wireless opportunism with minimal coordination. By mixing packets, network coding is able to reduce the number of transmissions necessary to convey packets to multiple receivers, which can lead to a large increase in throughput for multicast traffic. We discuss the design of a multicast enabled variant of MORE, a network coding based protocol for file transfer in wireless mesh networks, and evaluate this extension, which we call MORE-M, in a 20-node indoor wireless testbed. We compare MORE-M to a wireless multicast protocol that takes an approach similar to that of wired multicast by using the ETX metric to build unicast routing trees. We also compare MORE-M to a multicast enabled variant of the ExOR routing protocol. Experiments show that MORE-M's gains increase with the number of destinations, and are 35-200% greater than that of ExOR. We then consider the problem of video streaming in a wireless local area network for applications such as video conferencing. A network coding based protocol that uses opportunistic receptions at clients is proposed. We evaluate the design in our testbed and demonstrate that the use of network coding and, in particular, the use of wireless opportunism increase the quality of the video stream.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2007

Author dc:creator

• Jennings, Michael (Michael Vincent)

Advisor dc:contributor.advisor

• Dina Katabi.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/40532

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/40532