Reliability and Secrecy in Wireless Networks

Data transmission over relay nodes relies on the assumption that each relay node performs a predetermined function on its received signal and send the result over the network. However, a wireless relay network may have malfunctioning or malicious nodes (inserting errors), and existence of such nodes can reduce the capacity of the network. We develop the model for wireless network communication in the presence of a Byzantine adversary for different assumptions on channel/adversarial knowledge. We examine coding schemes which utilize signal interactions in the deterministic wireless network to reliably deliver information in the presence of such errors due to a Byzantine adversary.

On the other hand, reliably and secrecy of data transmission is an important issue in communication over a wireless network in presence of malicious nodes. Such node may wish to limit the communication by sending jamming signal to the network, or pretending to be the legitimate transmitter. On the other hand, the application may pose to keep the message private from all the nodes in the network, except the legitimate receiver. Both these problems have been well studied in point-to-point communication, under the topics of arbitrarily varying channels, and wiretap channels, respectively. The role of malicious nodes in wired networks has also received recent significant attention in network coded systems. However, these topics and many related problems have to be addressed in the context of wireless network. This is the topic of this project. 

Reliability and Secrecy in Wireless Networks