In this thesis the primary focus is on the problem of interference between messages. The thesis discusses why the messages are blocked in a system? How adding a message impacts the cost of all other available links, which can be established in the system.
This thesis analyzes how the availability of channels, increase in number of nodes and increase in the transmission range help in increasing the number of messages that can be handled in the network. It is also analyzes how critical is the selection of the maximum transmission range MTR, transmission range TR and required transmission range RTR.
Therefore, the focus is on the method of tagging or evaluation of cost for developing any communication link between two nodes. The thesis proposes a system of evaluation of cost of each link and then utilizes the standard Dijikstra\u27 s algorithm to evaluate the cost of each message route from its source to its destination.
Chapter 2 explains the proposed algorithms with examples and the way to evaluate the cost of the links, subsequently Chapter 3 discusses the actual simulation environment, the cost matrix, distance matrix and the comparison of various selections of number of nodes in the system (N), maximum transmission range (MTR) and the number of available channels for each node (Ch)
