Location based localized alternate, disjoint, multi-path and component routing schemes for wireless networks

In this paper we propose four schemes that improve the performance of greedy routing method. In the <i>alternate</i> method, the <i>i</i>-th received copy of message <i>m</i> is forwarded to <i>i</i>-th best neighbor, according to the selected criterion (it fails if number of copies exceeds number of neighbors). In the <i>disjoint</i> method, each intermediate node, upon receiving <i>m</i>, will forward it to its best neighbor among those who never received the message (it fails if no such neighbor exists). In the <i>multi-path</i> method, the source node <i>S</i> forwards <i>m</i> to <i>c</i> best neighbors according to distance from <i>D</i>. Each of <i>c</i> created copies afterwards follows the original, alternate, or disjoint method (these copies may interact since copy numbers are not communicated). <i>Component</i> routing method follows original greedy method until a failure node <i>F</i>. Such node <i>F</i> forwards the message to one node (using distance criteria) in each connected component of its neighbors, and then withdraws from the network for that message <i>m</i> (that is, neighboring nodes will ignore <i>F</i> when forwarding further copies of <i>m</i>). Thus <i>F</i> creates <i>c</i> copies of the message, where <i>c</i> is the number of connected components in the subgraph of its neighbors. All proposed methods are loop-free, have improved delivery rate over greedy method and reduced flooding rates compared to other existing methods. Component routing method guarantees delivery of <i>m</i> in connected graphs (even if the location of <i>D</i> is inaccurate).