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

Low latency probabilistic broadcast in wide area networks

In this paper we propose a novel probabilistic broadcast protocol that reduces the average end-to-end latency by dynamically adapting to network topology and tra cconditions. It does so by using an unique strategy that consists in adjusting the fanout and preferred targets for diferent gossip rounds as a function of the properties of each node.No declassification is light-weight and integrated in the protocol membership management. Furthermore, each node is not required to have full knowledge of the group membership or of the network topology. The paper shows how the protocol can be configured and evaluates its performance with a detailed simulation model

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page

Adaptive gossip-based broadcast

This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources available to the nodes within the same broadcast group and 2) to the global level of congestion in the system. The adaptation mechanism can be applied to all gossip-based broadcast algorithms we know of and makes their use more realistic in practical situations where nodes have limited resources whose quantity changes dynamically with time without decreasing the reliability.(undefined

Neighborhood gossip: Concurrent averaging through local interference

In this paper, we study a gossip algorithm for distributed averaging over a wireless sensor network. The usual assumption is that, through properly chosen codes, the physical layer is reduced to a set of reliable bit pipes for the distributed averaging algorithm. However, with a new channel coding technique, computation coding, we can exploit the interference property of the wireless medium for efficient averaging. This then provides a new abstraction for the physical layer: reliable linear equations instead of reliable bit pipes. The “neighborhood gossip” algorithm operates modularly on top of this abstraction. We will show that for certain regimes, such an approach can lead to energy savings that are exponential in the network size and time savings that are polynomial

Comparison of CSMA based MAC protocols of wireless sensor networks

Energy conservation has been an important area of interest in Wireless Sensor networks (WSNs). Medium Access Control (MAC) protocols play an important role in energy conservation. In this paper, we describe CSMA based MAC protocols for WSN and analyze the simulation results of these protocols. We implemented S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator which unlike other simulators simulates the same code running on real hardware. Previous surveys mainly focused on the classification of MAC protocols according to the techniques being used or problem dealt with and presented a theoretical evaluation of protocols. This paper presents the comparative study of CSMA based protocols for WSNs, showing which MAC protocol is suitable in a particular environment and supports the arguments with the simulation results. The comparative study can be used to find the best suited MAC protocol for wireless sensor networks in different environments.Comment: International Journal of AdHoc Network Systems, Volume 2, Number 2, April 201