Citation Context

...of increasing algorithm complexity and per node state requirement. The goal of the added cost is to reduce the number of redundant transmissions. 3.1 Simple Flooding The algorithm for Simple Flooding =-=[7, 8]-=- starts with a source node broadcasting a packet to all neighbors. Each of those neighbors in turn rebroadcast the packet exactly one time and this continues until all reachable network nodes have rec...

Citation Context

... The source S can then apply again the same routing algorithm [3] (or use path created in the previous step by D if that path was recorded in the process) to send the full message toward D. Ho et al. =-=[14]-=- argued that flooding can be a viable candidate for multicast and routing protocols in very dynamic ad hoc networks. Flooding has been replaced in [15], [23] by a method where each clusterhead and gat...

Citation Context

... On the other extreme are flooding based approaches, where message is flooded through the whole network area (broadcasting solves routing, and in high mobility scenario this could be optimal solution =-=[HOTV], if-=- optimized [PL, QVL, SSZ]), or portion of the area [BCSW, KV]. The ‘compromise’ is multi-path strategy, that is route composed of few single recognizable paths. Some algorithms are combinations of...

Citation Context

..., they are used for single sourcedestination route discovery in reactive and hybrid ad hoc routing protocols [10], [11], [12]; for exploration in directed diffusion [43]; for multi-hop broadcast [2], =-=[17]; for forming discov-=-ery trees [22]; for issuing network commands such as "sleep," "wake up"; for changing networkwide parameters such as transmit power, and for multihop time synchronization [27]. In ...

Citation Context

...ocols is the end-to-end broadcast latency which is the time taken by the message to reach all the nodes in the network. One of the earliest broadcast mechanisms proposed in the literature is flooding =-=[15, 17]-=-, where every node in the network retransmits a message to its neighbors after receiving it. Although flooding is extremely simple and easy to implement, it was shown in [22] that flooding can be very...

Citation Context

...ion may not be practical. Santivanez et al. [70] show that flooding is a good solution for the sake of scalability and simplicity. Several flooding techniques for wireless networks have been proposed =-=[71, 72, 64]-=-, each with respect to certain optimization criterion. However, none of them takes advantage of the feature that the transmission power of a node can be adjusted. Some distributed heuristics are propo...

Citation Context

...by using location and mobility information provided by the GPS [16]. Recently, arguing that conventional tree-based approaches are not appropriate for multicasting in ad hoc networks, Obraczka et al. =-=[8,18]-=- have suggested the use of flooding as a viable alternative. They point out that flooding is attractive for highly dynamic ad hoc environments because it does not need to maintain as much network stat...