Generalized instantly decodable network coding for relay-assisted networks
Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionPhysical Science and Engineering (PSE) Division
Date
2013-09Permanent link to this record
http://hdl.handle.net/10754/564794
Metadata
Show full item recordAbstract
In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.Citation
Elmahdy, A. M., Sorour, S., & Seddik, K. G. (2013). Generalized Instantly Decodable Network Coding for relay-assisted networks. 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). doi:10.1109/pimrc.2013.6666427Conference/Event name
2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2013ISBN
9781467362351arXiv
1311.1240ae974a485f413a2113503eed53cd6c53
10.1109/PIMRC.2013.6666427