An algebraic watchdog for wireless network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1159-1163

  Kim, Min Ji ^a   Médard, Muriel ^a   Barrosy, João ^b   Kötterz, Ralf ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PORTO   (Portugal)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC ANALYSIS; BUILDING BLOCKES; DETECTION PROTOCOLS; FALSE DETECTIONS; GRAPHICAL MODEL; HYPOTHESIS TESTING; INFERENCE PROCESS; MALICIOUS BEHAVIOR; SELF CHECKING; WIRELESS NETWORK CODING;

ALGEBRA; GRAPHIC METHODS; INFORMATION THEORY; LAW ENFORCEMENT;

WIRELESS NETWORKS;

EID: 70449514921     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206004     Document Type: Conference Paper

References (15)

1. J.-P. Hubaux, L. Buttyán, and S. Capkun, "The quest for security in mobile ad hoc networks," in MobiHoc '01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking& computing. New York, NY, USA: ACM, 2001, pp. 146-155.
2. S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in Proceedings of the 6th annual international conference on Mobile computing and networking. ACM, 2000, pp. 255-265.
3. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, pp. 1204-1216, 2000.
4. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Transaction on Networking, vol. 11, pp. 782-795, 2003.
5. D. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Communication, vol. 1, no. 1, pp. 3-20.
6. R. W. Yeung and N. Cai, "Network error correction," Communications in Information and Systems, no. 1, pp. 19-54, 2006.
7. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," in Proceedings of IEEE INFOCOM, March 2007, pp. 616 - 624.
8. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3579-3591.
9. M. Kim, M. Médard, and J. Barros, "Countering Byzantine adversaries with network coding: An overhead analysis," in Proceedings of MILCOM, 2008.
10. R. Perlman, "Network layer protocols with Byzantine robustness," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, October 1988.
11. M. Castro and B. Liskov, "Practical Byzantine fault tolerance," in Symposium on Operating Systems Design and Implementation (OSDI), February 1999.
12. L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382-401, 1982.
13. D. B. Johnson, "Routing in ad hoc networks of mobile hosts," in Proceedings of the Workshop on Mobile Computing Systems and Applications, 1994, pp. 158-163.
14. U. M. Maurer, "Authentication theory and hypothesis testing," IEEE Transaction on Information Theory, vol. 46, pp. 1350-1356, 2000.
15. M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger, "Polynomial hash functions are reliable," in Proceedings of the 19th International Colloquium on Automata, Languages and Programming, vol. 623. Springer-Verlag, 1992, pp. 235-246.