Simple Flooding Scheme Research Articles

A Simple and Energy-Efficient Flooding Scheme for Wireless Routing

In many wireless networks, such as ad hoc, sensor, and delay-tolerant networks, the destination node is determined from the source node by the flooding process. Flooding efficiency is important for nodes, because they are driven by limited batteries. In this paper, we propose a simple flooding scheme to transmit a route request (RREQ) message based on the remaining power of its own node without using control packets and complex calculations. We applied the proposed scheme to ad hoc on-demand distance vector (AODV) routing protocol as an example and carried out computer simulations (ns3). The results showed that the proposed scheme was superior to conventional schemes in static and mobile scenarios. First, we showed the limit of node density that causes the decrease of throughput in the proposed scheme and that the proposed scheme was superior in terms of energy efficiency (bits/J), including throughput and energy consumption. Next, as the number of flooding times is made uniform in the proposed scheme, all nodes will have almost the same battery replacement time. As a result, when the nodes are static, the lifetime in the proposed scheme is longer than that in the conventional scheme.

Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks

A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledge-based flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different pre-assigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms.

Hybrid Flooding Scheme for Mobile Ad Hoc Networks

A hybrid broadcast scheme for mobile wireless networks is proposed in this letter. The main objective is to combine different flooding schemes in order to solve the broadcast storm issue encountered by the simple flooding scheme. For this purpose, the density of nodes is taken into account using a density metric called expansion metric. In addition, in order to reduce the broken links due to mobility of nodes and increasing dissimilarity among the intermediate nodes, a forwarding zone criterion is included in the proposed schemes. The proposed approaches have been implemented and compared with pure probabilistic flooding, and simple flooding schemes.

Efficient power aware broadcasting technique for mobile ad hoc network

A mobile ad hoc network is a collection of mobile nodes which are able to organise by themselves. In MANET a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcast route request packet that are forwarded to all other nodes. A simple flooding scheme is employed in AODV, where every node rebroadcasts these route request packets even if some of its neighbours have already broadcast the requests. So there is redundancy in broadcasting which could potentially leads to high channel contention and collision so the broadcast storm problem will occur in MANET. In order to avoid this broadcast problem different types of techniques was implemented such as simple flooding method, probability based method, area based method, neighbour knowledge based method, efficient and dynamic probabilistic broadcasting methods are used. Instead of power loss it cause link failure then the process of data transfer is terminate and it diminishes the overall the network performances and will cost a large amount of network resources. In this, paper it proposed a new way of broadcasting technique called “Efficient Power Aware broadcasts (EPAB)” to provide an optimal path with suitable bandwidth and battery capacity. EPAB will help in increasing the throughput by decreasing the packet loss due to non-availability of node having enough battery power to retransmit the data packet to next node.

Multicasting in Large Wireless Networks: Bounds on the Minimum Energy Per Bit

In this paper, we consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied-dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption. We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting in arbitrary wireless networks when the channel state information is not available at the transmitters. Upper bounds are obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes. The gap between the upper and lower bounds is only a constant factor for dense random networks and regular networks, and differs by a poly-logarithmic factor for extended random networks. Furthermore, we show that the proposed upper and lower bounds for random networks hold almost surely in the node locations as the number of nodes approaches infinity.

On the application of epidemical spreading in collaborative context-aware computing

Pervasive Computing Research Group, Department of Informatics and Telecommunications, University of Athens, Panepistimiopolis, Ilissia, 15784, Athens, Greece. We investigate the very important concept of collaborative context awareness. Applications operating in nodes with spatial proximity and network connectivity exchange the contextual information (context) captured by their sensors (or other similar data sources). Such scheme improves the characteristics of the context aware application (e.g., robustness). The exchange of context in our model is progressed beyond a simple flooding scheme. We adopt an epidemic model, which relays information in a stochastic manner. In our model, nodes have a reasoning capability, which can further process and transform the incoming context. The derived context can be relayed throughout the network. This multi-epidemic model relies on semantic dependencies, which are modeled through a hierarchical representation scheme. We investigate the efficiency of the proposed architecture in light of different spreading parameters. Our simulations take into account the temporal validity of the exchanged context (i.e., relayed information remains valid for a certain period of time), the status of the sensing elements and the mobility of nodes. Our findings are quite promising for the emerging area of context aware application engineering.

PERFORMANCE EVALUATION OF MOBILE AD HOC NETWORKS USING ROUTING WITH SELFISH NODES

In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route request packets even if some of its neighbors have already broadcast the requests and thus the rebroadcasts may reach no additional nodes. Appropriate use of a probabilistic method can reduce the number of rebroadcasting; therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing reach ability or having any significant degradation. In this paper, we propose a selfish node based approach.

Performance Evaluation of Leveled Probabilistic Broadcasting in MANETs and Wireless Sensor Networks

In a mobile ad hoc network (MANET) or a wireless sensor network (WSN), a mobile node or sensor node can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV, where every node rebroadcasts these route request packets even if some of its neighbors have already received the requests, and thus the rebroadcasts may reach no additional nodes. To avoid such redundant packet relays, the authors propose a routing protocol based on a preassigned probability model. They compare their approach with AODV in terms of numerous metrics, including average number of rebroadcasts, average number of packet collisions, end-to-end delay, and throughput. Both analytical and simulation results show that their approach outperforms the AODV protocol for most cases.

Efficient search in unstructured peer‐to‐peer networks

AbstractThe huge popularity of recent peer‐to‐peer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as unstructured P2P networks, because they impose few constraints on topology and data placement and support highly versatile search mechanisms. A major limitation of unstructured P2P networks lies, however, in the inefficiency of their search algorithms, which are usually based on simple flooding schemes. In this paper, we propose novel mechanisms for improving search efficiency in unstructured P2P networks. Unlike other approaches, we do not rely on specialized search algorithms; instead, the peers perform local dynamic topology adaptations, based on the query traffic patterns, in order to spontaneously create communities of peers that share similar interests. The basic premise of such semantic communities is that file requests have a high probability of being fulfilled within the community they originate from, therefore increasing the search efficiency. We propose further extensions to balance the load among the peers and reduce the query traffic. Extensive simulations under realistic operating conditions substantiate that our techniques significantly improve the search efficiency and reduce the network load. Copyright © 2004 AEI