Journal of Communications and Networks

  • 제11권6호
  • /
  • Pages.564-573
  • /
  • 2009
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

Redundancy Minimizing Techniques for Robust Transmission in Wireless Networks

  • Kacewicz, Anna (School of Electrical and Computer Engineering, Cornell University) ;
  • Wicker, Stephen B. (School of Electrical and Computer Engineering, Cornell University)
  • Published : 2009.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

Abstract

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

Keywords

References

  1. P. Papadimitratos and Z.J. Haas, "Secure message transmission in mobile ad hoc networks," Ad Hoc Netw., pp.193–209, 2003
  2. A. Kacewicz and S.B.Wicker, "Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks," in Proc. Conference on Information Sciences and Systems, Princeton University, Mar. 2008
  3. S. J. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," in Proc. IEEE ICC, 2001, pp. 3201–3205
  4. A. Tsirigos and Z. J. Haas, "Analysis of multipath routing, part 1: The dffect on the packet delivery ratio," IEEE Trans. Wireless Commun., vol. 3, no. 1, Jan. 2004
  5. A. Tsirigos and Z. J. Haas, "Analysis of multipath routing, part 2: Mitigation of the effects of frequently changing network topologies," IEEE Trans. Wireless Commun., vol. 3, no. 2, Mar. 2004
  6. M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," J. ACM, pp. 335–348, 1989
  7. S. B. Wicker and V. K. Bhargava, Reed Solomon Codes and Their Applications, Piscataway: IEEE Press, 1994
  8. M. Luby, "LT-codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 271–280
  9. S. B. Wicker. Error Control Systems for Digital Communication and Storage. Upper Saddle River, NJ: Prentice Hall, 1995
  10. David J.C. MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge University Press, 2003
  11. R. Karp, M. Luby, and A. Shokrollahi, "Finite length analysis of LT codes," in Proc. IEEE ISIT, Chicago, June 2004
  12. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551–2567, June 2006 https://doi.org/10.1109/TIT.2006.874390
  13. E. Maneva and A. Shokrollahi, "New model for rigorous analysis of LT codes," in Proc. IEEE ISIT, Seattle, WA, July 2006
  14. Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, John-Wiley and Sons, Inc. 2nd ed., 2006
  15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and L. Stein, Introduction to Algorithms. 2nd ed., MIT Press, 2001
  16. P. Cataldi, M. P. Shatarski, M. Grangetto, and E. Magli, "Implementation and performance evaluation of LT and Raptor codes for multimedia applications," Intelligent Information Hiding and Multimedia Signal Processing, 2006
  17. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp.569–584, Feb. 2001 https://doi.org/10.1109/18.910575