A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks

Flooding is an essential and critical service in computer networks that is used by many routing protocols to send packets from a source to all nodes in the network. As the packets are forwarded once by each receiving node, many copies of the same packet traverse the network which leads to high redundancy and unnecessary usage of the sparse capacity of the transmission medium. Gossip routing is a well-known approach to improve the flooding in wireless multi-hop networks. Each node has a forwarding probability p that is either statically per-configured or determined by information that is available at runtime, e.g, the node degree. When a packet is received, the node selects a random number r. If the number r is below p, the packet is forwarded and otherwise, in the most simple gossip routing protocol, dropped. With this approach the redundancy can be reduced while at the same time the reachability is preserved if the value of the parameter p (and others) is chosen with consideration of the network topology. This technical report gives an overview of the relevant publications in the research domain of gossip routing and gives an insight in the improvements that can be achieved. We discuss the simulation setups and results of gossip routing protocols as well as further improved flooding schemes. The three most important metrics in this application domain are elaborated: reachability, redundancy, and management overhead. The published studies used simulation environments for their research and thus the assumptions, models, and parameters of the simulations are discussed and the feasibility of an application for real world wireless networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the focus of this survey but publications about other network types and technologies are also included. As percolation theory, epidemiological models, and delay tolerant networks are often referred as foundation, inspiration, or application of gossip routing in wireless networks, a brief introduction to each research domain is included and the applicability of the particular models for the gossip routing is discussed

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Broadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper

Encounter gossip: a high coverage broadcast protocol for MANET

PhD ThesisMobile Ad-hoc Networks (MANETs) allow deployment of mobile wireless devices or nodes in a range of environments without any fixed infrastructure and hence at a minimal setup cost. Broadcast support that assures a high coverage (i.e., a large fraction of nodes receiving a broadcast) is essential for hosting user applications, and is also non-trivial to achieve due to the nature of devices and mobility. We propose Encounter Gossip, a novel broadcast protocol, which holds minimal state and is unaware of network topology. Coverage obtained can be made arbitrarily close to 1 at a moderate cost of extra message tra c, even in partition-prone networks. Under certain simplifying assumptions, it is shown that a high coverage is achieved by making a total of O(n ln n) broadcasts, where n is the number of nodes, and the time to propagate a message is O(ln n). The e ect of various network parameters on the protocol performance is examined. We then propose modifications to minimise the number of redundant transmissions without compromising the achieved coverage. Two approaches are pursued: timer based and history based. The e ectiveness of each of these approaches is assessed through an extensive set of simulation experiments in the context of two mobility models. Specifically, we introduce a new heuristic alpha policy which achieves significant reduction in redundancy with negligible reduction in coverage. A generalisation to multiple broadcasts proceeding in parallel is proposed and the protocol is refined to reduce problems that can occur due to the effects of high mobility when transmitting a large number of messages. Finally, we implement and validate Encounter Gossip in the context of a real-life mobile ad-hoc network. All these investigations suggest that the protocol, together with the proposed modifications and re nements, is suited to MANETs of varying degrees of node densities and speeds

A Voice for the Voiceless: Peer-to-peer Mobile Phone Networks for a Community Radio Service

We propose a new application for mobile ad-hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue– the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

A Novel Approach to Load Balancing in P2P Overlay Networks for Edge Systems

Edge computing aims at addressing some limitations of cloud computing by bringing computation towards the edge of the system, i.e., closer to the client. There is a panoply of devices that can be integrated into future edge computing platforms, from local datacenters and ISP points of presence, to 5G towers, and even, multiple user devices like smartphones, laptops, and IoT devices. For all of these devices to communicate fruitfully, we need to build systems that enable the seamless interaction and cooperation among these diverse devices. However, creating and maintaining these systems is not trivial since there are numerous types of devices with different capacities. This resource heterogeneity has to be taken into account so that different types of machines contribute to the management of the distributed infrastructure differently, and the operation of the overall system becomes more efficient. In this work, we addressed the challenges identified above by exploring unstructured overlay networks, that have been shown to be possible to manage efficiently and in a fully decentralized way, while being highly robust to failures. To that end, we devised a solution that adapts the number of neighbors of each device (i.e., how many other devices that device knows) according to the capacity of that device and the distribution of capacities of the other devices in the network, as to ensure that the load is fairly distributed between them and, as a consequence, improve the operation of other services atop the unstructured overlay network, for instance, reducing the latencies experienced when broadcasting information. This solution can be easily integrated into most existing peer-to-peer distributed systems, requiring just a slight adaptation to their membership protocol. To show the correction and benefits of our proposal, we evaluated it by comparing it with state of the art decentralized solutions to manage unstructured overlay networks, combining both simulation (to observe the performance of the solution at large scale) and prototype deployments in realistic distributed infrastructures.A computação de periferia visa abordar algumas limitações da computação em nuvem, trazendo a computação para mais perto do cliente. Há uma enorme variedade de dispositivos que podem ser integrados em futuras plataformas de computação de periferia, de data centers locais e pontos de presença de ISPs a torres 5G e até mesmo dispositivos de cliente, como smartphones, laptops e dispositivos IoT. Para que todos esses dispositivos comuniquem de forma proveitosa entre si, precisamos construir sistemas que possibilitem a interação e cooperação eficaz entre eles. No entanto, criar e manter esses sistemas não é trivial, uma vez que existem vários tipos de dispositivos com diferentes capacidades. Essa heterogeneidade de recursos deve ser levada em consideração para que diferentes tipos de máquinas contribuam para o gerenciamento da infraestrutura distribuída de forma distinta e a operação do sistema se torne mais eficiente. Neste trabalho, enfrentámos os desafios identificados acima explorando redes sobrepostas não estruturadas, que se têm mostrado possíveis de gerenciar de forma eficiente e totalmente descentralizada, sendo altamente resistentes a falhas. Para tal, concebemos uma solução que adapta o número de vizinhos de cada dispositivo (ou seja, quantos outros dispositivos aquele dispositivo conhece) de acordo com a sua capacidade e a capacidade dos demais dispositivos da rede, de forma a garantir que a carga seja proporcionalmente distribuída entre eles e, como consequência, reduzindo as latências experienciadas por esses dispositivos. Esta solução pode ser facilmente integrada num sistema distribuído entre-pares existente, exigindo apenas uma ligeira adaptação ao seu protocolo de filiação. Avaliámos a nossa solução comparando-a com outras soluções descentralizadas de última geração, combinando simulação (para observar o desempenho da soluç

A Comparative Study of Energy Efficient Medium Access Control Protocols in Wireless Sensor Networks

This project investigates energy usage in three energy-efficient WSN MAC protocols (AS-MAC, SCP-MAC, and Crankshaft) on TelosB wireless sensors. It additionally presents BAS-MAC, an energy-efficient protocol of our own design. Our evaluations show that in single-hop networks with large send intervals and staggered sending, AS-MAC is best in the local gossip and convergecast scenarios, while SCP-MAC is best overall in the broadcast scenario. We conjecture that Crankshaft would perform best in extremely dense hybrid (unicast and broadcast) network topologies, especially those which broadcast frequently. Finally, BAS-MAC would be optimal in networks which utilize hybrid traffic with infrequent broadcasts, and where broadcasting is performed by motes that do not have an unlimited power source

Efficient Processing of Continuous Join Queries using Distributed Hash Tables

International audienceThis paper addresses the problem of computing approximate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based placement of tuples in a Distributed Hash Table (DHT) and dissemination of queries using a gossip style protocol. We provide a performance evaluation of DHTJoin which shows that DHTJoin can achieve significant performance gains in terms of network traffic

Node counting in wireless ad-hoc networks

We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct neighbors of each node. The algorithms are simulated, allowing comparison of their performance