3 research outputs found
AoI-based Multicast Routing over Voronoi Overlays with Minimal Overhead
The increasing pervasive and ubiquitous presence of devices at the edge of
the Internet is creating new scenarios for the emergence of novel services and
applications. This is particularly true for location- and context-aware
services. These services call for new decentralized, self-organizing
communication schemes that are able to face issues related to demanding
resource consumption constraints, while ensuring efficient locality-based
information dissemination and querying. Voronoi-based communication techniques
are among the most widely used solutions in this field. However, when used for
forwarding messages inside closed areas of the network (called Areas of
Interest, AoIs), these solutions generally require a significant overhead in
terms of redundant and/or unnecessary communications. This fact negatively
impacts both the devices' resource consumption levels, as well as the network
bandwidth usage. In order to eliminate all unnecessary communications, in this
paper we present the MABRAVO (Multicast Algorithm for Broadcast and Routing
over AoIs in Voronoi Overlays) protocol suite. MABRAVO allows to forward
information within an AoI in a Voronoi network using only local information,
reaching all the devices in the area, and using the lowest possible number of
messages, i.e., just one message for each node included in the AoI. The paper
presents the mathematical and algorithmic descriptions of MABRAVO, as well as
experimental findings of its performance, showing its ability to reduce
communication costs to the strictly minimum required.Comment: Submitted to: IEEE Access; CodeOcean: DOI:10.24433/CO.1722184.v1;
code: https://github.com/michelealbano/mabrav