About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 758340, 10 pages
http://dx.doi.org/10.1155/2012/758340
Research Article

Distributed Intrusion Detection of Byzantine Attacks in Wireless Networks with Random Linear Network Coding

Department of Electrical Engineering, National Dong Hwa University, No. 1, Sec. 2, Da Hsueh Road, Shoufeng, Hualien 97401, Taiwan

Received 23 October 2012; Accepted 27 November 2012

Academic Editor: Haigang Gong

Copyright © 2012 Jen-Yeu Chen and Yi-Ying Tseng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Ahlswede, N. Cai, S. yen Robert Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000.
  2. R. Koetter, M. Mdard, and S. Member, “An algebraic approach to network coding,” IEEE/ACM Transactions on Networking, vol. 11, pp. 782–795, 2003.
  3. R. Dougherty, C. Freiling, and K. Zeger, “Insufficiency of linear coding in network information flow,” IEEE Transactions on Information Theory, vol. 51, no. 8, pp. 2745–2759, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, “The benefits of coding over routing in a randomized setting,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT' 03), July 2003. View at Scopus
  5. D. S. Lun, M. Mdard, and M. Effros, “On coding for reliable communication over packet networks,” in Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004.
  6. T. Ho, B. Leong, R. Koetter, M. Médard, M. Effros, and D. R. Karger, “Byzantine modification detection in multicast networks using randomized network coding,” in Proceedings of the IEEE International Symposium on Information Theory, p. 143, July 2004. View at Scopus
  7. D. Charles, K. Jain, and K. Lauter, “Signatures for network coding,” in Proceedings of the 40th Annual Conference on Information Sciences and Systems, vol. 1, pp. 3–14, March 2009.
  8. M. N. Krohn, M. J. Freedman, and D. Mazières, “On-the-fly verification of rateless erasure codes for efficient content distribution,” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 226–239, May 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Koetter and F. R. Kschischang, “Coding for errors and erasures in random network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '07), pp. 791–795, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Silva, F. R. Kschischang, and R. Köetter, “A rank-metric approach to error control in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 3951–3967, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Silva and F. R. Kschischang, “Using rank-metric codes for error correction in random network coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '07), pp. 796–800, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Silva, F. R. Kschischang, and R. Kötter, “Capacity of random network coding under a probabilistic error model,” in Proceedings of the 24th Biennial Symposium on Communications (BSC '08), pp. 9–12, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Jaggi, M. Langberg, S. Katti et al., “Resilient network coding in the presence of byzantine adversaries,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2596–2603, 2008. View at Publisher · View at Google Scholar · View at Scopus