## 1 Introduction
Neighbors are thus candidates to forward a request or content. These multiple forwarding candidates increase the probability of a packet being delivered to producer nodes or to forwarding nodes which are temporarily able to provide contents from their cache. The development of WMNs based on NDN, however, is a challenge because of the broadcast storm problem [16] caused by the forwarding of interest packets. With NDN, each node broadcasts an interest packet received for the first time. Thereafter, every neighbor will repeat the same behavior, leading to a broadcast storm of interest packets. In this context, nodes can experience a high collision rate depending on the number of consumers, i.e., nodes that request contents, and on the transmission rate of interest packets. Collisions increase packet losses and delay which are both caused by the retransmission of lost interest packets. This scenario characterizes the broadcast storm problem. This paper proposes three mechanisms that limit the forwarding of interest packets in order to reduce the negative effects of the broadcast storm in WMNs. The goal of the proposed mechanisms is to decrease the number of interest packets forwarded by nodes and thus, to decrease the probability of collisions caused by these packets. Nodes, in this case, experience a higher delivery rate and lower delivery delay if the number of collisions decreases. The first proposed mechanism is called Probabilistic Interest Forwarding (PIF). With PIF, high-centrality nodes forward packets with a certain probability (\(p\)). With the second one, called Retransmission-Counter-based Interest Forwarding (ReCIF), nodes use the number of hops traversed by an interest packet in order to forward this packet or not. The third proposed mechanism, called ReCIF+PIF, combines the criteria of PIF and ReCIF. The idea is to guarantee that interest packets forwarded fewer times have priority to be forwarded by a node, and other interest packets are forwarded with a probability of \(p\). Our three mechanisms are compared with both the default NDN forwarding mechanism and the Listen First Broadcast Later(LFBL) mechanism. The content delivery rate, the delivery delay, and the overhead are the metrics considered in the simulation. The results show that the proposed mechanisms are more efficient in scenarios with a higher number of nodes contending to access the medium. For these scenarios, our mechanisms provide a content delivery rate that is 21% higher, with 25% less delivery delay than the default NDN forwarding mechanism. Our mechanisms also outperform LFBL regarding the data delivery rate and delivery delay by up to 263% and 55% respectively for high network contention levels. The next sessions are organized as follows. Section 2 presents a brief overview of WMNs based on the NDN architecture. Section 3 discusses several works related to the adoption of caching and ICN architectures in WMNs. This section also presents proposals to deal with the broadcast storm problem in ad-hoc networks. Section 4 introduces the proposed mechanisms. Section 5 presents the simulation environment and discusses the simulation results. Section 6 presents the concluding remarks and comments about future work.