BLOOGO: BLOOm filter based GOssip algorithm for wireless NDN

Authors:
Fabio Angius;Mario Gerla;Giovanni Pau
Affiliations:
University of California Los Angeles, Los Angeles, CA, USA;University of California Los Angeles, Los Angeles, CA, USA;University of California Los Angeles, Los Angeles, CA, USA
Venue:
Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design - Architecture, Algorithms, and Applications
Year:
2012

Citing 10
Cited 0

Flooding-based geocasting protocols for mobile ad hoc networks

Mobile Networks and Applications
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
VoCCN: voice-over content-centric networks

Proceedings of the 2009 workshop on Re-architecting the internet
Ad hoc networking via named data

Proceedings of the fifth ACM international workshop on Mobility in the evolving internet architecture
A deterministic approach to throughput scaling in wireless networks

IEEE Transactions on Information Theory
Randomized gossip algorithms

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern ad-hoc networks focus on data rather than ob- solete end-to-end communications. This paper describes BlooGo, a gossip algorithm that disseminates messages throughout the network with a minimum number of trans- missions. Its peculiarity lies on the fact that without any knowledge of the network the receiver of a packet can de- cides autonomously whether to forward it or not. All the information that BlooGo uses to decide the utility of a transmission is enclosed in the packet as a bloom filter; this way the parties, i.e. sender and receiver, never have to communicate directly. This approach makes BlooGo state-less; lightweight; power-efficient; ideal for sensors or embedded devices that use the NDN philosophy.