PROJECT TITLE :
A Numerical Study on the Wiretap Network With a Simple Network Topology
During this paper, we have a tendency to study a security downside on a simple wiretap network, consisting of a supply node S, a destination node D, and an intermediate node R. The intermediate node connects the supply and therefore the destination nodes via a group of noiseless parallel channels, with sizes and , respectively. A message is to be sent from S to D. The knowledge within the network could be eavesdropped by a group of wiretappers. The wiretappers cannot communicate with each other. Every wiretapper will access a subset of channels, called a wiretap set. All the chosen wiretap sets kind a wiretap pattern. A random key is generated at S, and a coding theme on is employed to shield . We tend to define two decoding classes at D. In Category-I, only is required to be recovered, and in Category-II, each and are required to be recovered. The objective is to reduce for a given wiretap pattern beneath the proper secrecy constraint. The primary querywe tend to address is whether or not routing is perfect on this easy network. By enumerating all the wiretap patterns on the category-I/II (three, three) networks and harnessing the power of Shannon-kind inequalities, we have a tendency to notice that gaps exist between the bounds implied by routing and also the bounds implied by Shannon-sort- inequalities for a tiny fraction (
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here