Abstract

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.

Highlights

  • We are witnessing a fast and vast expansion of the Internet at its edges [1]

  • This paper presents the very first completely decentralized solution that allows to forward information within a delimited Areas of Interest (AoIs) using only local information, and achieving the lowest possible number of messages

  • AoI-CAST ALGORITHM MABRAVOR This subsection presents MABRAVO Reverse (MABRAVOR), which is an AoI-cast protocol that builds over the results presented in subsection III-C to compute AoIcast trees in a distributed manner with local information only

Read more

Summary

Introduction

We are witnessing a fast and vast expansion of the Internet at its edges [1] This is mainly due to the pervasive diffusion in the environment of smart objects, such as sensors, Internet of Things (IoT) devices, user personal devices, etc. This scenario allows the emergence of novel services and applications [2]–[8], supported by potentially large networks of highly distributed and autonomous devices. Traditional centralized control and communication techniques do not suit the needs and requirements of such an environment These devices are usually equipped with computing and communication capabilities, that allow them to create and exchange information both among themselves and with other remote services.

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call