QMNF is a QoS-aware multicast routing protocol using N-hop dominating flooding and built upon a layered routing architecture. In this architecture, QMNF invites the N-hop flooding component and the shortest path routing table from OSPF by open signaling interfaces, floods the path-probing packets, and employs a two-pass resource reservation scheme to avoid unnecessary resource reservation. The QMNF is QoS-aware, loop-free, flexible and scalable, and improves network resource utilization. In our simulation, the performance of QMNF is compared with that of traditional flooding protocol with the shortest path resources reservation, a traditional flooding protocol with the widest path resources reservation, PIM and QMBF. The simulation results confirm that QMNF has a high success rate and good resource utilization, and it can distribute traffic in a network evenly.

Flooding is usually utilized to find a multi-hop route toward a node which is not within transmission range. However, existing flooding schemes deteriorate the performance of network because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve the problem, a lightweight and novel flooding scheme is proposed in this paper. The scheme employs ongoing packets for constructing a cluster architecture as the existing on-demand clustering scheme. Unlike to the existing schemes, it makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results prove that it causes fewer packet transmissions and fewer collisions than those of two other schemes.

A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.

This paper presents novel flooding schemes for wireless mobile ad hoc networks. Clustering of nodes is assumed as a basic ad hoc network structure. GWF (Gateway Forwarding) and SGF (Selected Gateway Forwarding) are presented based on clustering. A new protocol, termed FGS (Flooding Gateway Selection) protocol, between a cluster head and its gateways to realize SGF is presented. It is shown that SGF significantly improves the packet delivery performance in ad hoc networks by reducing flooding traffic.

A highly reliable network which can restore itself from network failures is one important concept for the future high capacity broadband network. In such self-healing network, flooding based failure-restoration algorithm is used to locate new routes and then to reroute failure traffic to that routes automatically when network failures such as link or node failures occur. Since the speed of this algorithm is degraded by the large amount of restoration messages produced by the process, such large volume messages should be reduced. In this paper, the scheme will be proposed, which reduces the large volume messages and efficiently selects alternative routes. In this scheme, the Message Wall will be used to filter useless restoration messages at the tandem nodes and Multi-Message Selecting method will be used to rapidly select a group of link-disjointed alternative routes from the feasible ones in each Flooding Wave sequence. The simulation results show that restoration messages are dramatically reduced and adequate alternative routes can be quickly found out.