skip to main content
10.1145/2486001.2491728acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
poster
Free access

Greedy forwarding for mobile social networks embedded in hyperbolic spaces

Published: 27 August 2013 Publication History

Abstract

In this work, we design and evaluate a novel greedy forwarding algorithm using metrics in hyperbolic spaces. Hyperbolic geometry has a natural topological reflection of scale-free networks, and greedy algorithm failed in Euclidean space becomes possible in hyperbolic one. We show that mobile social networks can be successfully embedded in such spaces, and obtains competitive performance in terms of message delivery ratio and cost. Under this result, we thus intuitively reveal the fundamental reason that why the famous BUBBLE Rap achieves the optimal performance.

References

[1]
Y. Li, G. Su, et al., "The impact of node selfishness on multicasting in delay tolerant networks," ph IEEE Transactions on Vehicular Technology, vol. 60, no. 5, pp. 2224--2238, 2011.
[2]
Y. Li, P. Hui, et al., "Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks," phIEEE Communications Letters, vol. 14, no. 11, pp. 1026--1028, 2010.
[3]
P. Hui, J. Crowcroft, and E. Yoneki. BUBBLE rap: Social-based forwarding in delay-tolerant networks. IEEE Trans. on Mobile Computing, 10(11):1576--1589, Nov. 2011.
[4]
Y. Li, Y. Jiang, et al., "Energy-efficient optimal opportunistic forwarding for delay-tolerant networks," phIEEE Transactions on Vehicular Technology, vol. 59, no. 9, pp. 4500--4512, 2010.
[5]
Y. Li, Z. Wang, et al., "Collaborative vehicular content dissemination with directional antennas," phIEEE Transactions on Wireless Communications, vol. 11, no. 4, pp. 1301--1306, 2012.
[6]
M. Boguná, et al., Sustaining the internet with hyperbolic mapping. Nat Commun, 1:62, Sept. 2010.
[7]
Y. Li, D. Jin, et al., "Revealing contact interval patterns in large scale urban vehicular ad hoc networks," phACM SIGCOMM Computer Communication Review, vol. 42, no. 4, pp. 299--300, 2012.

Cited By

View all
  • (2020)An Asymmetric Popularity-Similarity Optimization Method for Embedding Directed Networks into Hyperbolic SpaceComplexity10.1155/2020/83729282020Online publication date: 22-Apr-2020
  • (2017)Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2017.26902584:3(140-153)Online publication date: 1-Jul-2017
  • (2017)A path-based recommendations approach for online systems via hyperbolic network embedding2017 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC.2017.8024652(973-980)Online publication date: Jul-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
August 2013
580 pages
ISBN:9781450320566
DOI:10.1145/2486001
  • cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 43, Issue 4
    October 2013
    595 pages
    ISSN:0146-4833
    DOI:10.1145/2534169
    Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2013

Check for updates

Author Tags

  1. greedy forwarding
  2. hyperbolic spaces
  3. mobile social networks

Qualifiers

  • Poster

Conference

SIGCOMM'13
Sponsor:
SIGCOMM'13: ACM SIGCOMM 2013 Conference
August 12 - 16, 2013
Hong Kong, China

Acceptance Rates

SIGCOMM '13 Paper Acceptance Rate 38 of 246 submissions, 15%;
Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)42
  • Downloads (Last 6 weeks)5
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2020)An Asymmetric Popularity-Similarity Optimization Method for Embedding Directed Networks into Hyperbolic SpaceComplexity10.1155/2020/83729282020Online publication date: 22-Apr-2020
  • (2017)Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2017.26902584:3(140-153)Online publication date: 1-Jul-2017
  • (2017)A path-based recommendations approach for online systems via hyperbolic network embedding2017 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC.2017.8024652(973-980)Online publication date: Jul-2017
  • (2017)Navigability of temporal networks in hyperbolic spaceScientific Reports10.1038/s41598-017-15041-07:1Online publication date: 8-Nov-2017
  • (2015)On Stochastic Analysis of Greedy Routing in Vehicular NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2015.244677116:6(3353-3366)Online publication date: Dec-2015

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media