During the route discovery process, each node receiving the route request packet (RReq) will retransmit it exactly once. A distant neighbor may accidentally receive/loose the only RReq and use it to announce a new route, although that link is inferior/superior for route reply packets (RRep) or actual message routing. Overall, the constructed route may be far from the optimal. All existing route discovery schemes (including DSR/AODV) apply retransmission during route discovery exactly once (1R). Based on a realistic physical layer model, we propose two new route discovery schemes: n-retransmission (nR, retransmitting exactly n times) and n-retransmission c-reception (ncRR), retransmitting until we either reach a total of n own retransmissions or c copies from neighbors are heard. We compare our two new scheme with the traditional one, under otherwise identical conditions (same metric, same packet reception probability on each link) and the same choices about possibly retransmitting again upon discovering a better route (R+) or discarding it (R1), generating route reply packet for every received RRep (B*), or for first and better discovered routes only (B2), and retransmitting RRep exactly once (A1), up to a maximum of three times (A3), or optimally u times decided by link quality (Au). Experimental results show that the proposed ncRR scheme (for n=2 and c=3 or c=4) achieves the best tradeoff between quality of route, success rate and message overhead in the route discovery process, followed by the nR scheme, and both of them are superior to the existing traditional schemes.
Identifer | oai:union.ndltd.org:uottawa.ca/oai:ruor.uottawa.ca:10393/20254 |
Date | January 2011 |
Creators | Jin, Xiangyang |
Contributors | Stojmenovic, Ivan |
Publisher | Université d'Ottawa / University of Ottawa |
Source Sets | Université d’Ottawa |
Language | English |
Detected Language | English |
Type | Thesis |
Page generated in 0.0023 seconds