Fault-Tolerant Transfer Algorithm Based on Interweaving Code in Opportunistic Networks

Article Preview

Abstract:

In order to resolve the problem of data packets losing abruptly in opportunistic networks, a fault-tolerant transfer algorithm based on interweaving code is proposed. The algorithm includes two parts: one is used by nodes sending data and another is used by receiving nodes to recover lost data. When the packets are sent, interweaving idea is used to disperse the packets. When the packets are received, interpolation method is used to recover the sequence of lost packets based on the strong autocorrelation of transferred packet. Then, interpolation method is used to recover lost data.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

341-344

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Akyildiz IF, Akan B, Chen C, Fang J, Su W. InterPlaNetary Internet: State-of-the-Art and research challenges. Computer Networks, 2003, 43(2): 75−112.

DOI: 10.1016/s1389-1286(03)00345-1

Google Scholar

[2] Widmer J, Boudec JL. Network coding for efficient communication in extreme networks. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM, 2005. 284−291.

DOI: 10.1145/1080139.1080147

Google Scholar

[3] Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002. 96−107.

DOI: 10.1145/605397.605408

Google Scholar

[4] Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006, 44(11): 134−141.

DOI: 10.1109/mcom.2006.248176

Google Scholar