Abstract
Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.