ABSTRACT
This chapter explores for gathering and organizing the information about works in the field of nature inspired algorithms for wireless multi-hop ad hoc networks used in disaster scenarios. It describes the main optimization problems of wireless multi-hop ad hoc networks that can be found in disaster scenarios. The nodes' placement problem refers to finding the specific locations to place fixed nodes, with the aim of increasing network connectivity. Routing protocols, which are responsible for finding a communication path between the source and destination nodes, play a very important role. Within the topology-based approach, there are two main categories of routing algorithms for Ad Hoc Networks: reactive and proactive protocols. The chapter reviews some of the most frequently used disaster scenario mobility models. These models can be classified according to different aspects. However, the main features to consider for organizing them are: the individuals that are modelled and whether the individuals' mobility is random or presents a certain level of tactics.
