Improvised Broadcast Algorithm for Wireless Networks

Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to several problems which arise during broadcasting. Two major problems faced are namely, Broadcast Storm Problem and Disconnected network problem. In a highly dense network, if information is being flooded in a loop, it could lead to broadcast storm. The broadcast storm may eventually crash the entire network and lead to loss of information. Mobility of the nodes may lead to the problem of Disconnected Network. If the two nodes sending and receiving information are mobile with different speeds, it could lead to a disconnection between them as soon as the receiver moves out of the communication range. In this paper, we are trying to solve both the problems based on our proposed algorithms.Comment: 4 page

Local Pruning for Information Dissemination in Dynamic Networks for Solving the Idempotent Semiring Algebraic Path Problem

We present a method, inspired from routing in dynamic data networks, to solve the Semiring Algebraic Path Problem (SAPP) for dynamic graphs. The method can be used in dynamic networks such as Mobile Ad Hoc Networks, where the network link states are highly dynamic. The algorithm makes use of broadcasting as primary mechanism to recompute the SAPP solution. The solution suffers from broadcast storm problems, and we propose a selective broadcasting mechanism that reduces the broadcast storm. We call this method local pruning and prove its correctness

SURVEI PENANGANAN BROADCAST STORM PROBLEM PADA PROTOKOL ROUTING AODV DI MANET

Komunikasi multi-hop pada lingkungan MANET dapat melibatkan broadcast paket dalam proses route discovery. Protokol routing pada MANET akan melakukan broadcast paket RREQ dan menjalarkannya ke node tujuan secepat dan seefisien mungkin, dimana paket RREQ dari rute yang optimal adalah paket RREQ yang terlebih dahulu sampai ke tujuan. Aktifitas broadcast yang tidak terkontrol dapat menyebabkan suatu kondisi yang disebut broadcast storm problem. Broadcast storm problem dapat berdampak pada terganggunya kinerja dari protokol routing akibat adanya packet redundancy, contention, dan collision. Broadcast storm problem dapat ditangani dengan membatasi jumlah node yang dapat melakukan broadcast. Tujuan utama dari pembuatan makalah ini adalah merangkum beberapa mekanisme terbaru yang telah diakukan oleh para peneliti untuk menangani broadcast storm problem. Kami juga menyajikan perbandingan dari mekanisme tersebut berdasarkan karakteristik dari mekanisme ditinjau dari kesesuaian dengan beberapa skema penanganan broadcast storm problem yang diajukan oleh peneliti sebelumnya, kebutuhan informasi tertentu antar node, lingkungan uji coba dan apakah mekanisme ini dapat diterapkan pada protokol routing lainnya

Connectivity Investigation of Channel Quality-Based Adaptive Gossip Flooding Mechanism for AODV

To address the “broadcast storm” problem associated with flooding-based route discovery mechanism of reactive routing protocols, probabilistic approaches are suggested in the literature. In the earlier work, Gossip flooding mechanism of Haas et.al. was extended with signal quality, to propose channel quality based adaptive gossip flooding mechanism for AODV (CQAG-AODV). Following the cross-layer design principle, CQAG-AODV algorithm tried to discover robust routes, as well as address the “broadcast storm” problem by controlling the rebroadcast probability of Route request (RREQ) packets on the basis of signal strength experienced at the physical layer. This paper investigates the connectivity of CQAG-AODV through theoretical and simulation analysis. Results show that, by accounting the signal strength in the route discovery process, not only does the proposed algorithm floods  a lesser number of route requests and controls the broadcast storm, but also maintains a higher level of connectivity to offer high packet delivery ratio; independent of network density and node mobility. Moreover, due to controlled routing overhead and robust route discovery, channel quality based adaptive flooding mechanism offers fringe benefit of energy efficiency as well. CQAG-AODV thus proves its suitability in a variety of use cases of multi-hop ad hoc networks including WSNs and VANETs

Efficient Route Discovery and Repair in Mobile Ad-hoc Networks

[[abstract]]Building proper routing protocols for a Mobile Ad-hoc Network (MANET) is a critical challenge because (1) flooding route requests often results in broadcast storm (especially when nodes or connections increase) and (2) re-broadcasting route discovery packets to rebuild or repair a broken path (caused by node mobility) will consume more control packets. To solve such broadcast storm and path damage problems, this paper mixes the ideas of multipoint relaying and 2-hop route repair into a new routing protocol suitable for large-scale MANETs. Simulation results show that the new protocol can effectively repair damaged routes at reduced bandwidth consumption.[[conferencetype]]國際[[conferencedate]]20120326~20120329[[iscallforpapers]]Y[[conferencelocation]]Fukuoka, Japa

SCALABLE MULTI-HOP DATA DISSEMINATION IN VEHICULAR AD HOC NETWORKS

Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly simultaneously. The broadcast storm problem is still challenging in the context of VANET, due to the rapid changes in the network topology, which are difficult to predict and manage. Existing solutions either do not scale well under high density scenarios, or require extra communication overhead to estimate traffic density, so as to manage data dissemination accordingly. In this dissertation, we specifically aim at providing an efficient solution for the broadcast storm problem in VANETs, in order to support different types of applications. A novel approach is developed to provide scalable broadcast without extra communication overhead, by relying on traffic regime estimation using speed data. We theoretically validate the utilization of speed instead of the density to estimate traffic flow. The results of simulating our approach under different density scenarios show its efficiency in providing scalable multi-hop data dissemination for VANETs

Mitigating Broadcast Storm on Metro Ethernet Network Using PVST+

Broadcast storm attack on the layer 2 networks included looping and duplicate packets that are transmitted continuously in order to prevent the service of the network, thus, it is the type of attack that is against availability. In this research, a Spanning Tree Protocol method, namely PVST+ (Per VLAN Spanning Tree Plus), is used to overcome the problem caused by the broadcast storm attack on Metro Ethernet Network. The PVST+ serves as a redundant network management and it prevented looping on the network. The result obtained from this research is PVST+ is able to mitigate broadcast strom that is shown by the decrease of number of packets and the decrease of the average packet per-second. The average packets per-second on VLAN 1 decrease to 274,041 and the average packets on VLAN 10 decrease to 267,794 packets per-second

Novel Composite Approach to Reduce Broadcast Storm Problem

Broadcasting is the fundamental operation in mobile ad hoc network (MANET). Broadcasting is a side effect of flooding where each mobile nodes in the network can transmit the redundant packets to its neighboring nodes which are in the same transmission range. When mobile nodes are increased then network become dense and it leads to the problems such as redundant rebroadcast, contention and collision. These prone the high protocol overhead and intrusion with existing data traffic . Many MANET protocols such as Ad hoc On demand distance vector (AODV) and Dynamic Source Routing (DSR), Zone Routing Protocol (ZRP), Location Aided Routing (LAR) rely on broadcasting during route discovery mechanism which causes the broadcast storm problem. The main focus of this paper to understand AODV and DSR protocols and its side effect of broadcasting and propose an algorithm to reduce the broadcast storm problem