Title :
Application of Reed-Muller Codes for Localization of Malicious Nodes
Author :
Kacewicz, Anna ; Wicker, Stephen
Author_Institution :
Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA
Abstract :
We consider a wireless network and address the problem of detecting and localizing malicious nodes in a single source/destination configuration. The malicious nodes are found through the use of Reed-Muller codes. Reed-Muller codes are used to select the necessary paths between source and destination. Based on the graph connectivity matrix, these necessary paths, and the probability that a node is malicious, our algorithm determines all the paths in the network. The minimum distance of the code determines how many malicious nodes can be localized. We develop an algorithm for the case when a set of paths is not realizable in the network and compare the performance of the algorithm with other techniques.
Keywords :
Reed-Muller codes; graph theory; matrix algebra; probability; telecommunication security; Reed-Muller codes; graph connectivity matrix; malicious node localization; node probability; single source-destination configuration; wireless network; Application software; Communication system traffic control; Communications Society; Computer network reliability; Cryptography; Error correction; Peer to peer computing; Protocols; Robustness; Telecommunication network reliability;
Conference_Titel :
Communications (ICC), 2010 IEEE International Conference on
Conference_Location :
Cape Town
Print_ISBN :
978-1-4244-6402-9
DOI :
10.1109/ICC.2010.5501749