Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14240
Title: Reduced-complexity network coding for multicasting over ad hoc networks
Authors: Wu, Y
Kung, SY
Keywords: Ad hoc networks
Directed graphs
Multicast communication
Telecommunication network routing
Issue Date: 2005
Publisher: IEEE
Source: 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing : proceedings : March 18-23, 2005, Pennsylvania Convention Center/Marriott Hotel, Philadelphia, Pennsylvania, USA, v. 3, p. iii/501-iii/504 How to cite?
Abstract: Network coding generalizes the conventional routing paradigm by allowing nodes to mix information received on its incoming links to generate information to be transmitted to other nodes. As a result, network coding improves throughput, resource efficiency, robustness, manageability, etc., in wired and wireless ad hoc networks. In particular, it was established that network coding can achieve the maximum rate for multicasting information from a source node to multiple destination nodes. The objective of this work is to show how to achieve the aforementioned multicast capacity with lower processing/implementation complexity than that proposed in the literature. We classify the links in a network into two categories: 1) links entering relay nodes; and 2) links entering destinations. We show the same multicast capacity can be achieved by applying (non-trivial) network coding only on the links entering relay nodes. In other words, links entering destinations only require routing, which leads to a saving in the complexity. The novelty of this work lies in a new algorithm, its proof of correctness, and a complexity analysis.
URI: http://hdl.handle.net/10397/14240
ISBN: 0-7803-8874-7
ISSN: 1520-6149
DOI: 10.1109/ICASSP.2005.1415756
Appears in Collections:Conference Paper

SFX Query Show full item record

SCOPUSTM   
Citations

14
Last Week
9
Last month
Citations as of Dec 6, 2017

Page view(s)

34
Last Week
0
Last month
Citations as of Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.