A distributed routing algorithm for multihop packet radio networks with uni- and bi-directional links

In multihop packet radio networks (PRNs) the nodes are not all within direct radio range of each other; to be able to forward the packets to their final destination the nodes must have enough knowledge about the network topology. This information is usually represented in the form of routing and distance tables. On a packet radio network the connectivity among the nodes can change due to several causes such as node or link failures and the presence of mobile nodes which can join or leave the network. This dynamic nature of the network topology requires that the tables at each node be continuously and accurately updated to avoid unnecessary delays or incorrect packet forwarding. The manner in which the packets are forwarded in the method proposed here is called incremental source routing, i.e. each node keeps a routing table which indicates the next hop (a node address) for each network final destination. Each packet is then delivered incrementally by the decisions made by each node in the path from source to destination