Random network coding‐based optimal scheme for perfect wireless packet retransmission problems
dc.contributor.author | Gao, Zhenguo | en_US |
dc.contributor.author | Xiang, Weidong | en_US |
dc.contributor.author | Zhao, Yunlong | en_US |
dc.contributor.author | Zhao, Jing | en_US |
dc.contributor.author | Cai, Shaobin | en_US |
dc.contributor.author | Pan, Wu | en_US |
dc.contributor.author | Jiang, Hua | en_US |
dc.contributor.author | Wang, Huiqiang | en_US |
dc.date.accessioned | 2013-05-02T19:35:24Z | |
dc.date.available | 2014-05-23T15:04:20Z | en_US |
dc.date.issued | 2013-04-25 | en_US |
dc.identifier.citation | Gao, Zhenguo; Xiang, Weidong; Zhao, Yunlong; Zhao, Jing; Cai, Shaobin; Pan, Wu; Jiang, Hua; Wang, Huiqiang (2013). "Random network coding‐based optimal scheme for perfect wireless packet retransmission problems." Wireless Communications and Mobile Computing 13(6): 577-592. <http://hdl.handle.net/2027.42/97523> | en_US |
dc.identifier.issn | 1530-8669 | en_US |
dc.identifier.issn | 1530-8677 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/97523 | |
dc.description.abstract | Solving wireless packet retransmission problems (WPRTPs) using network coding (NC) approach is increasingly attracting research efforts. However, existing researches are almost all focused on solutions in Galois field GF(2), and consequently, the solutions found by these schemes are usually less optimal. In this paper, we focus on optimal NC‐based scheme for perfect WPRTPs (P‐WPRTPs) where, with respect to each receiver, a packet is either requested by or already known to it. The number of retransmitted packets in optimal NC‐based solutions to P‐WPRTPs is firstly analyzed and proved. Then, random network coding‐based optimal scheme (RNCOPT) is proposed for P‐WRPTPs. RNCOPT is optimal in the sense that it guarantees to obtain a valid solution with minimum number of packet retransmissions. Furthermore, in RNCOPT, each coding vector is generated using a publicly known pseudorandom function with a randomly selected seed. The seed, instead of the coding vector, is used as decoding information to be retransmitted together with the coded packet. Thus, packet overhead of RNCOPT is reduced further. Extensive simulations show that RNCOPT distinctively outperforms some previous typical schemes for P‐WPRTPs in saving the number of retransmitted packets. Copyright © 2011 John Wiley & Sons, Ltd. This paper studied Perfect Wireless Packet ReTransmission Problems (P‐WPRTPs) where, with respect to each receiver, a packet is either requested by or already known to it. The number of retransmitted packets in optimal NC‐based solutions to P‐WPRTPs was analyzed and proved. Then, random network coding‐based optimal scheme (RNCOPT) is proposed for P‐WPRTPs. RNCOPT is optimal in the sense that it guarantees to obtain a valid solution with minimum number of packet retransmissions. | en_US |
dc.publisher | IEEE Information Society | en_US |
dc.publisher | Wiley Periodicals, Inc. | en_US |
dc.subject.other | Optimal Scheme | en_US |
dc.subject.other | Perfect Wireless Packet Retransmission Problem | en_US |
dc.subject.other | Random Network Coding | en_US |
dc.title | Random network coding‐based optimal scheme for perfect wireless packet retransmission problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Electrical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/97523/1/wcm1122.pdf | |
dc.identifier.doi | 10.1002/wcm.1122 | en_US |
dc.identifier.source | Wireless Communications and Mobile Computing | en_US |
dc.identifier.citedreference | Nguyen D, Tran T, Nguyen T, Bose B. Wireless broadcast using network coding. IEEE Transactions on Vehicular Technology 2009; 58 ( 2 ): 914 – 925. | en_US |
dc.identifier.citedreference | Bar‐Yossef Z, Birk Y, Jayram TS, Kol T. Index coding with side information. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA. IEEE Computer Society: Washington, DC, 2006; 197 – 206. | en_US |
dc.identifier.citedreference | Wu YN, Kung SY. Reduced-complexity network coding for multicasting over ad hoc network. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Philadelphia, PA. IEEE Press: Piscataway, NJ, 2005; 18 – 23. | en_US |
dc.identifier.citedreference | Fragouli C, Boudec JYL, Widmer J. Network coding: an instant primer. ACM SIGCOMM Computer Communication Review 2006; 36 ( 1 ): 63 – 68. | en_US |
dc.identifier.citedreference | Fragouli C, Katabi D, Markopoulou A, Médard M, Rahul H. Wireless network coding: opportunities & challenges. In Proceedings of the IEEE Military Communications Conference, Orlando, FL. IEEE Press: Piscataway, NJ, 2007; 1 – 8. | en_US |
dc.identifier.citedreference | Ahlswede R, Cai N, Li SYR, Yeung RW. Network information flow. IEEE Transactions on Information Theory 2000; 46 ( 4 ): 1204 – 1216. | en_US |
dc.identifier.citedreference | Wu YN, Padhye J, Chandra R, Padmanabhan V, Chou PA. The local mixing problem. In Proceedings of Information Theory and Applications Workshop, San Diego. IEEE Press: La Jolla, CA, 2007. | en_US |
dc.identifier.citedreference | El Rouayheb SY, Chaudhry MAR, Sprintson A. On the minimum number of transmissions in single‐hop wireless coding networks. In Proceedings of the IEEE Information Theory Workshop, Lake Tahoe, CA. IEEE Information Society: Tahoe City, CA, 2007; 120 – 125. | en_US |
dc.identifier.citedreference | Xu YL, Zhan C, Luo W, Li P. Network coding based reliable multicast for wireless ad hoc networks. Journal of University of Science and Technology of China 2008; 38 ( 7 ): 860 – 886. | en_US |
dc.identifier.citedreference | El Rouayheb SY, Sprintson A, Georghiades CN. On the index coding problem and its relation to network coding and matroid theory. IEEE Transactions on Information Theory 2010; 56 ( 7 ): 3187 – 3195. | en_US |
dc.identifier.citedreference | He MF, Bai TL, Ren LW. Tutorial of Linear Algebra. Press of Northeast Financial and Commercial University: Dalian, 2003. | en_US |
dc.identifier.citedreference | Dong QF, Wu JM, Hu WJ, Crowcroft J. Practical network coding in wireless networks. In Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, Montreal, Quebec. ACM: New York, NY, 2007. | en_US |
dc.identifier.citedreference | Katti S, Rahul H, Hu WJ, Katabi D, Médard M, Crowcroft J. XORs in the air: practical wireless network coding. ACM SIGCOMM Computer Communication Review 2006; 36 ( 4 ): 243 – 254. | en_US |
dc.identifier.citedreference | Ho T, Médard M, Shi J, Effros M, Karger D. On randomized network coding. In Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL. IEEE Press: Piscataway, NJ, 2003. | en_US |
dc.identifier.citedreference | Zhang X, Wicker SB. Robustness vs efficiency in sensor networks. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks, Kaohsiung. IEEE Press: Piscataway, NJ, 2005; 225 – 230. | en_US |
dc.identifier.citedreference | Sengupta S, Rayanchu S, Banerjee S. An analysis of wireless network coding for unicast sessions: the case for coding‐aware routing. In Proceedings of the 26th Annual IEEE Conference on Computer Communications, Anchorage, AK. IEEE Communicatioins Society: New York, NY, 2007; 1028 – 1036. | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.