Show simple item record

MORE: A Network Coding Approach to Opportunistic Routing

dc.date.accessioned2006-07-03T14:16:54Z
dc.date.accessioned2018-11-24T10:24:57Z
dc.date.available2006-07-03T14:16:54Z
dc.date.available2018-11-24T10:24:57Z
dc.date.issued2006-06-30
dc.identifier.urihttp://hdl.handle.net/1721.1/33230
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/33230
dc.description.abstractOpportunistic routing has the potential to substantially increase wireless network throughput. Prior work on opportunistic routing, however, requires tight node coordination. Different nodes in a network must have knowledge of which packets other nodes have received. Furthermore, the nodes have to agree on which nodes should transmit which packets. Such coordination becomes fragile in dense or large networks.This paper introduces MORe, a new opportunistic routing protocol that avoids node-coordination. Our design is rooted in the theory of network coding.Routers code packets going to the same destination and forward the coded versions. The destination decodes and recovers the original packets. This approach needs no coordination and provably maximizes network throughput. We have implemented our design and evaluated it in a 25-node testbed. Our results show that MORE provides an average throughput increase of 60% and a maximum of 10-fold, demonstrating that the theoretical gains promised by network coding are realizable in practice.
dc.format.extent12 p.
dc.format.extent22051455 bytes
dc.format.extent883727 bytes
dc.language.isoen_US
dc.subjectNetwork Coding
dc.subjectOpportunistic Routing
dc.subjectWireless Networks
dc.titleMORE: A Network Coding Approach to Opportunistic Routing


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2006-049.pdf883.7Kbapplication/pdfView/Open
MIT-CSAIL-TR-2006-049.ps22.05Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record