## 1 Introduction  
Multihop Sensor Networks are a collection of sensors equipped with a wireless interface, each of which uses other nodes as relays. This type of network presents various advantages over traditional wired networks, mainly the ease of deployment. In sensor networks, it becomes necessary to measure variables over a vast region. Multihop Sensor Networks can also be found in the IoT networks by seeking to interconnect all things surrounding people with their environment to gather data from those things [1, 2]. However, the one aspect that makes these networks both attractive and challenging is the nodes' ability to communicate over long distances using other nodes as relays. In this sense, it is common that nodes seek a specific resource (such as a sensor with specific capabilities, a sink to transmit it or even finding a route to a specific node) before exchanging data [3]. Resource discovery can be achieved by using a traditional flooding technique where the resource is searched over all the possible nodes in the network. Although more complex route discovery protocols exist, traditional flooding remains the most widely used protocol in practice. In this protocol, a source node broadcasts a search packet looking for a specific target node. This packet is received only by nodes located within the source node's transmission range. Upon receiving a search packet, a node adds its node ID to the packet header and retransmits it as soon as possible. This process continues until every node in the network has retransmitted the search packet. Once a search packet reaches the target node, it can respond to the source node, using unicast packets, through the reverse route stored in the packet header. Traditional flooding represents a robust and straightforward solution for route discovery, but it generates many packets, consuming much bandwidth [4]. Even though nodes in traditional flooding retransmit search packets once, many collisions may occur in densely populated networks due to a large number of nodes transmitting search packets simultaneously [5; 6]. These collisions generate unnecessary retransmissions, increasing contention, and channel access delays for both control and data packets. This problem is known as the broadcast storm problem [4; 7]. Various authors have proposed alternative methods to route discovery in ad hoc and sensor networks to address traditional flooding drawbacks. Although these protocols were originally designed for routing, these can also be applied to a resource discovery flooding. The following section presents a discussion of this issue in detail. However, most approaches attempt to repeal the propagation of flooded packets with chase flooding once either the source or target nodes reach each other. In general, protocols where the chase initiates at the destination are more efficient at stopping earlier the propagation of flooded packets. Repeal-based schemes can also be classified as bounded or unbounded, depending on the area nodes are allowed to chase and stop the propagation of the original flooding. Unbounded protocols allow any target node at any distance from the source node to chase the original flooding. On the other hand, bounded protocols allow a target node to chase ongoing flooding only if located within a given hop count from the source node. If the target node is not found, the maximum hop count is increased until, at a given hop count distance, the target node is finally found. However, repeal-based protocols source or destination initiated, bounded or unbounded might end up transmitting even more signaling packets than the original flooding protocol they try to outperform. Figure 1 illustrates, in general terms, the behavior of most repeal-based flooding protocols vs. Flood and Contain (F&C). This figure is not the result of any simulation experiment, but a trending behavior observed in other works and the simulations performed at the end of this work (refer to Figure 13).