GTNS is a discrete-event network simulator targeted primarily for research and educational use. GTNS is written in Visual C++ programming language and supports different network topologies. This simulator was first produced to implement a locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs. LMAR can find an ad-hoc path without selfish nodes and wormholes using an exhaustive search algorithm in polynomial time. Also when the primary path fails, it discovers an alternative safe path if the network graph remains connected after eliminating selfish/malicious nodes. The key feature of LMAR to seek a safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is an equi-loaded compared to single-path routing protocols but its security efficiency to bypass the attacks is much better than the other multi-path routing protocols. LMAR concept is introduced to provide the security feature known as availability and a simulator has been developed to analyze its behavior in complex network environments [1]. Then we have added a detection mechanism to the simulator, which can detect selfish nodes in the network. The proposed algorithm is resilient against collision and can be used in networks where wireless nodes use directional antennas and it also defend against an attack that malicious nodes try to break communications by relaying the packets in a specific direction. Some game-theoretic strategies to enforce cooperation in the network have been implemented in GTNS, for example, Forwarding-Ratio Strategy, TFT-Strategy, and ERTFT. This tutorial helps new users to get familiar with GTNS and run different network scenarios.
Check our published Code: