A practical scheduling approach to network coding for wireless local repair

Saleh, Juma Ben; Elhakeem, A.K.

doi:10.1109/bsc.2010.5472943

Cited by 12 publications

(20 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wireless video broadcasting with peer-to-peer error recovery is proposed in [26]. An efficient scheduling approach to network coding for wireless local repair is introduced in [27]. [28] proposes a cooperative IPTV system with pseudobroadcast to improve reliability.…”

Section: Related Workmentioning

confidence: 99%

Cooperative video streaming on smartphones

Seferoğlu

Keller

Cici

et al. 2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-Video applications are increasingly popular over smartphones. However, in current cellular systems, the downlink data rate fluctuates and the loss rate can be quite high. We are interested in the scenario where a group of smartphone users, within proximity of each other, are interested in viewing the same video at the same time and are also willing to cooperate with each other. We propose a system that maximizes the video quality by appropriately using all available resources, namely the cellular connections to the phones as well as the device-todevice links that can be established via Bluetooth or WiFi. Key ingredients of our design are: (i) the cooperation among users, (ii) network coding, and (iii) exploiting broadcast in the mobileto-mobile links. Our approach is grounded on a network utility maximization formulation of the problem. We present numerical results that demonstrate the benefit of our approach, and we implement a prototype on android phones.

show abstract

Section: Related Workmentioning

confidence: 99%

Cooperative video streaming on smartphones

Seferoğlu

Keller

Cici

et al. 2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…Error recovery in general D2D is investigated in [12]- [16]. However, the prior works on IDNC-based D2D systems only consider fully connected (FC-D2D) networks, i.e., each device can target all other devices over one-hop transmission, and thus only one device transmits at each time slot.…”

Section: Introductionmentioning

confidence: 99%

Delay reduction in multi-hop device-to-device communication using network coding

Douik

Sorour

Al-Naffouri

et al. 2015

2015 International Symposium on Network Coding (NetCod)

View full text Add to dashboard Cite

This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.

show abstract

“…However, with NC, intermediate nodes code/combine a number of received packets and then send the resulting coded packet to their neighbors. The simplest way to create a coded packet is to XOR a certain number of the original packets [6]. A neighbor node, upon receipt of one such coded packet, will then be able to find an individual component packet, provided that it has all the other original packets within the coded packet.…”

Section: Introductionmentioning

confidence: 99%

“…The chosen NCP is determined by the scheduling algorithm. Using the assigned Walsh functions, each node combines different images belonging to the NCP, as per (6). The Walsh coded packet generated by node u can be presented as follows:…”

mentioning

confidence: 99%

See 1 more Smart Citation

Random Network Coding Effects on CDMA/TDD Mesh Networks

Saleh

Elhakeem

2011

2011 Ninth Annual Communication Networks and Services Research Conference

Self Cite

View full text Add to dashboard Cite

The effects of random network coding on code division multiple access/time division duplex (CDMA/TDD) platforms are studied and evaluated. A multi-hop mesh network with both single source and multiple receiving nodes is assumed. Two scenarios are evaluated for their efficiency. The study focuses on the effects of uncontrolled parameters such as the minimum number of neighbors and the network connectivity, and of controlled parameters such as the Galois Field (GF) size and the Processing Gain. The results show that applying random network coding to code division multiple access/time division duplex systems could provide a noticeable improvement in overall efficiency. Keywords-Random NetworkCoding; code division multiaccess/time division duplex; mesh networks and wireless communications

show abstract

A practical scheduling approach to network coding for wireless local repair

Cited by 12 publications

References 5 publications

Cooperative video streaming on smartphones

Cooperative video streaming on smartphones

Delay reduction in multi-hop device-to-device communication using network coding

Random Network Coding Effects on CDMA/TDD Mesh Networks

Contact Info

Product

Resources

About