Learn More
In this paper, we developed an efficient global on-demand routing protocol for mobile ad hoc networks. In this protocol, nodes do not update their routing tables immediately if they change status, such as movement, addition or deletion. Instead, nodes dynamically run the Dijkstra's algorithm on-demand to keep the shortest paths for packet transmissions(More)
  • 1