A reliable multipath routing protocol for ad-hoc network

Ad-hoc networks are a new wireless networking paradigm for mobile hosts. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastructure or administrative support. The topology of the network changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. We propose some efficient multipath approaches that provide more secure routing schemes for ad-hoc network than previous ones. Within these approaches, more than one routing paths are selected. With the underlying coding technique, it can guarantee security against some malicious parties (it depends on how robust system is). Moreover, we apply these schemes into existing ad-hoc network routing protocols, table-driven and on-demand routing algorithms. Finally, we derive the relation between some probabilities on our algorithms.