Optimal Instantly Decodable Network Codes for Multi-Sender Scenarios

Ambadi, N (2019) Optimal Instantly Decodable Network Codes for Multi-Sender Scenarios. In: 2019 IEEE Wireless Communications and Networking Conference, WCNC 2019, 15 - 19 April 2019, Marrakesh.

PDF WCNC_2019.pdf - Published Version Restricted to Registered users only Download (12MB) | Request a copy

Abstract

Instantly Decodable Network Codes (IDNCs) are of practical interest in many broadcast and multicast applications in both wired and wireless networks. They have low encoding and decoding complexities (simple XORing) and lower decoding delay. This work explores multi-sender multicast-broadcast scenarios and gives the theoretically optimal algorithm to find instantly decodable network codes. All the broadcast symbols are scheduled by a control node. At any particular instant of time, only one sender broadcasts coded symbols. No sender-to-sender communication is assumed. The optimality criterion is maximizing the number of users that are able to decode exactly one amongst the messages they desire, when a coded symbol is broadcasted. An IDNC graph is defined with the messages as vertices, and edges denoting the infeasibility of combining the messages to form an IDNC broadcast symbol. The solution consists of finding maximum independent sets in certain induced subgraphs of the IDNC graph. This problem is known to be NP-hard in the general case. Simulation results show the improvement in the average decoding delay experienced by the users and the total completion time compared to the uncoded ARQ re-transmissions in a broadcast erasure channel. © 2019 IEEE.

Item Type:	Conference Paper
Publication:	IEEE Wireless Communications and Networking Conference, WCNC
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Broadcasting; Decoding; Multicasting; Optimization, Broadcast and multicast; Encoding and decoding; Index coding; Induced subgraphs; Maximum independent sets; Optimality criteria; Total completion time; Wired and wireless, Network coding
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	13 Dec 2022 05:13
Last Modified:	13 Dec 2022 05:13
URI:	https://eprints.iisc.ac.in/id/eprint/78337

Actions (login required)

View Item