A new survey of routing algorithms in ad hoc networks

Ad hoc networks are wireless networks without a fixed infrastructure, which are usually assembled on a temporary basis to serve a specific deployment such as emergency rescue or battlefield communication. The differentiating feature of an ad hoc network is that the functionality normally assigned to infrastructure components, such as access points, switches, and routers. For most cases, there is an assumption that the participating nodes are mobile, do not have a guaranteed uptime, and have limited energy resources. For wired domain trusted and reliable solutions exist. The infrastructure's topology, its bandwidth, and its routing are provisioned to provide a good fit with the expected traffic. In ad hoc networks, however, routing becomes a significant concern, because it needs to be handled by ordinary nodes that have neither specialized equipment nor a fixed, privileged position in the network. These challenges were answered with a large number of routing algorithms, but each protocol is suitable for some networks. In this research we compare the reactive and proactive protocols and have discussed that which type of protocols are suitable for which type of networks.