Efficient routing protocols for packet-radio networks based on tree sharing

This paper presents, proves correctness for, and evaluates two new routing protocols for mobile ad hoc networks (or packet-radio networks) based on the partial dissemination of link-state information. The first protocol, called partial tree sharing protocol (PTSP), combines the cost-reducing methods of TBRPF and ALP, so that each node reports to neighbors only links in its source tree (as in ALP), but sends only part of its source tree to each neighbor. In this manner, PTSP guarantees that no node receives the same information from more than one neighbor. The second protocol is called full tree sharing protocol (FTSP), and is an improvement of ALP and LVA that avoids sending a delete update as long as the network does not partition. We prove that FTSP generates fewer updates than ALP. Simulation results for 20-node networks show that PTSP, FTSP, and TBRPF all generate much less traffic than flooding, and PTSP generates up to 67% less traffic than FTSP.