Network coding with low complexity in wireless ad-hoc multicast networks

Jingyao Zhang, Pingyi Fan, Khaled Letaief

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

To reduce the cost and complexity of network coding in multicast networks, we propose an algorithm to obtain the routes of the maximum flow and the encoding nodes. Thus the coding operation can be taken at these nodes only, rather than throughout the whole network. A practical approach for wireless Ad-hoc network is also given. Moreover, based on a random graph model of Ad-hoc network, we will show that the encoding node number and the maximum flow value between a source and destination pair approximately obey the geometric and the Poisson distribution, respectively.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Pages3699-3704
Number of pages6
Volume8
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: 11 Jul 200615 Jul 2006

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period11/7/0615/7/06

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Zhang, J., Fan, P., & Letaief, K. (2006). Network coding with low complexity in wireless ad-hoc multicast networks. In 2006 IEEE International Conference on Communications, ICC 2006 (Vol. 8, pp. 3699-3704). [4025048] https://doi.org/10.1109/ICC.2006.255647