Efficient broadcast on area of interest in voronoi overlays

Michele Albano*, Ranieri Baraglia, Matteo Mordacchini, Laura Ricci

*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

4 Citations (Scopus)

Abstract

This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer network. The proposed algorithm is an advanced version of the Compass Routing algorithm, and it is able to guarantee the delivery of 100% of the packets, while minimizing the total number of packets that travel the network. The algorithm has been theoretically analyzed, and it has been implemented on a proof of concept peer-to-peer application, and experimental results show that the algorithm actually respects the reduced number of total packets used, as per the theoretical analysis.

Original languageEnglish
Title of host publicationProceedings - 12th IEEE International Conference on Computational Science and Engineering, CSE 2009
Number of pages8
Publication date29 Aug 2009
Pages224-231
Article number5283036
ISBN (Print)9780769538235
DOIs
Publication statusPublished - 29 Aug 2009
Externally publishedYes
Event2009 International Conference on Computational Science and Engineering, CSE '09 - Vancouver, BC, Canada
Duration: 29 Aug 200931 Aug 2009

Conference

Conference2009 International Conference on Computational Science and Engineering, CSE '09
Country/TerritoryCanada
CityVancouver, BC
Period29/08/200931/08/2009
SponsorIEEE, IEEE Computer Society, IEEE Technical Committee on Scalable Computing (TCSC)
SeriesProceedings - 12th IEEE International Conference on Computational Science and Engineering, CSE 2009
Volume1

Fingerprint

Dive into the research topics of 'Efficient broadcast on area of interest in voronoi overlays'. Together they form a unique fingerprint.

Cite this