For the protocol headers of wireless network data prone to errors, this paper puts forward with a bit-flip subset restriction header recovery algorithm after studying the one based on Cyclic Redundancy Check (CRC). A constraint subset of the received vector centric is set up to narrow the search space by exploiting the confidence information of each bit, overcoming the defect of high complexity of the former header recovery algorithm. Then, the theatrical analysis and experimental verification about the value range of the test vector’s length are done combining the models of wireless signal and wireless channel. The simulation results show that this method can maintain the well performance with a low computing cost, adjusting the test vector’s length towards wireless signals with different Signal to Noise Ratio (SNR).
Woo G R, Kheradpour P, Shen D, et al.. Beyond the bits: cooperative packet recovery using physical layer information
[C]
Proceedings of the ACM Internet Conference on Mobile Computing and Network, Quebec, Canada, 2007: 147-158.
[2]
Aman M N, Sikdar B, and Chan W K. Efficient packet recovery in wireless networks[C]. Proceedings of the Wireless Communications and Networking Conference (WCNC), Istanbul, Turkey, 2014: 1791-1796.
[3]
Wang S S, Sheu S T, Lee Y H, et al.. CPR: a CRC-based packet recovery mechanism for wireless networks[C]. Proceedings of the Wireless Communications and Networking Conference (WCNC), Shanghai, China, 2013: 321-326.
[4]
Duhamel P and Kiffer M. Joint Source-channel Decoding: a Cross-layer Perspective with Applications in Video Broadcasting[M]. UK, Academic Press, 2009: 193-246.
Shi L T, Li O, Wang X M, et al.. An active fault-tolerant scheme with high energy efficiency in wireless sensor networks[J]. Journal of Circuits and Systems, 2013, 18(2): 102-107.
[6]
Schmid F, Orlear D, and Wehrle K. A heuristic header error recovery scheme for RTP[C]. Proceedings of the Wireless On-demand Network Systems and Services (WONS), Alberta, Canada, 2013: 186-190.
[7]
Kiffer M and Duhamel P. Joint protocol and channel decoding: an overview[C]. Proceedings of the Future Network Mobile Summit, Florence, Italy, 2010: 1-16.
[8]
Marin C, Leprovost Y, and Kiffer M. Robust MAC-lite and soft header recovery for packetized multimedia transmission [J]. IEEE Transactions on Communications, 2010, 58(3): 775-782.
[9]
Meriaux F and Kiffer M. Robust IP and UDP-lite header recovery for packetized multimedia transmission[C]. Proceedings of the International Conference on Acoustics, Speech and Signal Processing(ICASSP), Texas, USA, 2010: 2358-2361.
[10]
Chase D. Class of algorithms for decoding block codes with channel measurement information[J]. IEEE Transactions on Information Theory, 1972, 18(1): 170-181.
Dang X Y, Tao J, Yu X B, et al.. A low-complexity adaptive chase decoding algorithm for turbo product code[J]. Journal of Electronics & Information Technology, 2014, 36(3): 739-743.
[12]
Wolf J K. Efficient maximum likelihood decoding of linear block codes using a trellis[J]. IEEE Transactions on Information Theory, 1978, 24(1): 76-80.
[13]
Esmaeili M, Alampour A, and Gulliver T A. Decoding binary linear block codes[J]. IEEE Transactions on Communications, 2013, 61(6): 2138-2144.
[14]
Argon C and McLaughlin S W. An efficient chase decoder for turbo product codes[J]. IEEE Transactions on Communications, 2004, 52(6): 896-898.
Feng Z, Zheng H X, and Qin M C. Performance simulation and research on turbo product codes over AWGN and Rayleigh channels[J]. Ratio Engineering, 2013, 43(9): 7-9.
Zheng H, Lu P Z, and Hu H Y. Iterative decoding algorithm for product codes based on bipartite graphs[J]. Journal of Electronics & Information Technology, 2006, 28(1): 86-90.
[19]
IEEE Std 802.11-2007. Part 11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications[S]. 2007.
