skip to main content
10.1145/1364654.1364712acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

Folksonomy-based reasoning in opportunistic networks

Published: 10 December 2007 Publication History

Abstract

Disparate algorithms are being designed to decide certain basic questions in opportunistic networks. This position paper describes a nascent idea that aims to provide a single framework to answer such questions. Inspired by the concept of a generic knowledge plane, we propose to study whether the information embodied in folksonomies can be used to make network decisions in opportunistic networks.

References

[1]
Aruna Balasubramanian, Brian Levine, and Arun Venkataramani. DTN routing as a resource allocation problem. In Proc. ACM SIGCOMM, 2007.
[2]
D. Clark, C. Partridge, J. C. Ramming, and J. T. Wroclawski. A Knowledge Plane for the Internet. In Proc. ACM SIGCOMM, 2003.
[3]
P. Hui et al. Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments. In Proc. SIGCOMM DTN Workshop, 2005.
[4]
Pan Hui and Jon Crowcroft. Bubble rap: Forwarding in small world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, Cambridge Univ., Comp. Lab., 2007.
[5]
Pan Hui, Eiko Yoneki, Shu yan Chan, and Jon Crowcroft. Distributed community detection in delay tolerant networks. In Sigcomm Workshop MobiArch '07.
[6]
Adam Mathes. Folksonomies - cooperative classification and communication through shared metadata. Computer Mediated Communication - LIS590CMC, Graduate School of Library and Information Science, University of Illinois Urbana-Champaign, Dec 2004.
[7]
Jörg Ott and Dirk Kutscher. A disconnection-tolerant transport for drive-thru internet environments. In INFOCOM, pages 1849--1862, 2005.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '07: Proceedings of the 2007 ACM CoNEXT conference
December 2007
448 pages
ISBN:9781595937704
DOI:10.1145/1364654
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 December 2007

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 173
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media