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

Poisson distribution
Network coding
Wireless ad hoc networks
Ad hoc networks
Costs

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

Network coding with low complexity in wireless ad-hoc multicast networks. / Zhang, Jingyao; Fan, Pingyi; Letaief, Khaled.

2006 IEEE International Conference on Communications, ICC 2006. Vol. 8 2006. p. 3699-3704 4025048.

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

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, 4025048, pp. 3699-3704, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 11/7/06. https://doi.org/10.1109/ICC.2006.255647
Zhang J, Fan P, Letaief K. Network coding with low complexity in wireless ad-hoc multicast networks. In 2006 IEEE International Conference on Communications, ICC 2006. Vol. 8. 2006. p. 3699-3704. 4025048 https://doi.org/10.1109/ICC.2006.255647
Zhang, Jingyao ; Fan, Pingyi ; Letaief, Khaled. / Network coding with low complexity in wireless ad-hoc multicast networks. 2006 IEEE International Conference on Communications, ICC 2006. Vol. 8 2006. pp. 3699-3704
@inproceedings{1debb8558ba8493cb45f56a5230d7e29,
title = "Network coding with low complexity in wireless ad-hoc multicast networks",
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.",
author = "Jingyao Zhang and Pingyi Fan and Khaled Letaief",
year = "2006",
doi = "10.1109/ICC.2006.255647",
language = "English",
isbn = "1424403553",
volume = "8",
pages = "3699--3704",
booktitle = "2006 IEEE International Conference on Communications, ICC 2006",

}

TY - GEN

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

AU - Zhang, Jingyao

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=42549112196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=42549112196&partnerID=8YFLogxK

U2 - 10.1109/ICC.2006.255647

DO - 10.1109/ICC.2006.255647

M3 - Conference contribution

SN - 1424403553

SN - 9781424403554

VL - 8

SP - 3699

EP - 3704

BT - 2006 IEEE International Conference on Communications, ICC 2006

ER -