FinalComm: Leveraging Dynamic Communities to Improve Forwarding in DTNs
Pages 55 - 62
Abstract
This article proposes a social-based routing protocol for Delay-Tolerant Networks (DTNs) known as FinalComm. FinalComm allows nodes to build a view of the existing communities in the network. With this information, nodes are able to relay messages after computing if the neighbor will most probably meet the destination or any other node from the community of the destination of the message. Simulation results shows that FinalComm is able to achieve a high delivery rate and an extremely low overhead ratio, if compared with four other routing protocols. Specifically, FinalComm presents average gains of 31.4% in terms of delivery rate in comparison with other routing protocols for the scenarios considered.
References
[1]
Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman. 2001. Search in power-law networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 64, 4 II (sep 2001), 461351--461358. 10.1103/PhysRevE.64.046135 arXiv:cs/0103016
[2]
Frans Ekman, Ari Keränen, Jouni Karvo, and Jörg Ott. 2008. Working Day Movement Model. In Proceedings of the 1st ACM SIGMOBILEWorkshop on Mobility Models (MobilityModels '08). ACM, New York, NY, USA, 33--40.
[3]
Pan Hui and Jon Crowcroft. 2007. How small labels create big improvements. In Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007. 65--70.
[4]
Pan Hui, Jon Crowcroft, and Eiko Yoneki. 2011. BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks. IEEE Transactions on Mobile Computing 10, 11 (Nov. 2011), 1576--1589.
[5]
Ari Keränen, Jörg Ott, and Teemu Kärkkäinen. 2009. The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 55.
[6]
Maurice J. Khabbaz, ChadiMAssi, and Wissam F. Fawaz. 2012. Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges. IEEE Communications Surveys & Tutorials 14, 2 (jan 2012), 607--640.
[7]
Anders Lindgren, Avri Doria, and Olov Schelén. 2007. Probabilistic routing in intermittently connected networks. Technical Report. RFC 6639. http://datatracker.ietf.org/doc/rfc6639
[8]
Naércio Magaia, Carlos Borrego, Paulo Pereira, and Miguel Correia. 2017. PRIVO: A PRIvacy-preserVing Opportunistic routing protocol for Delay-Tolerant Networks. In IFIP Networking 2017. http://dl.ifip.org/db/conf/networking/networking2017/1570333245.pdf
[9]
Naércio Magaia, Alexandre P. Francisco, Paulo Pereira, and Miguel Correia. 2015. Betweenness centrality in Delay Tolerant Networks: A survey. Ad Hoc Networks 33 (2015), 284--305.
[10]
Naércio Magaia, Alexandre P. Francisco, Paulo Pereira, and Miguel Correia. 2015. Betweenness centrality in Delay Tolerant Networks: A survey. Ad Hoc Networks 33 (2015), 284--305.
[11]
Waldir Moreira, Paulo Mendes, and Susana Sargento. 2012. Opportunistic routing based on daily routines. In 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2012 - Digital Proceedings. IEEE, 1--6. arXiv:arXiv:1407.8368v1
[12]
Mark EJ Newman. 2004. Analysis of weighted networks. Physical Review E 70, 5 (2004), 056131.
[13]
Gergely Palla, Imre Derényi, Illés Farkas, and Tamás Vicsek. 2005. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 7043 (jun 2005), 814--818.
[14]
Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S Raghavendra. 2005. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delaytolerant networking. ACM, 252--259.
[15]
Amin Vahdat and David Becker. 2000. Epidemic routing for partially connected ad hoc networks. Technical Report. Technical Report CS-200006, Duke University.
[16]
K. Wei, X. Liang, and K. Xu. 2014. A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues. IEEE Communications Surveys Tutorials 16, 1 (First 2014), 556--578.
[17]
Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang. 2013. A survey of social-based routing in delay tolerant networks: positive and negative social effects. IEEE Communications Surveys & Tutorials 15, 1 (2013), 387--401.
Index Terms
- FinalComm: Leveraging Dynamic Communities to Improve Forwarding in DTNs
Recommendations
Similarity Degree-Based Mobility Pattern Aware Routing in DTNs
IUCE '09: Proceedings of the 2009 International Symposium on Intelligent Ubiquitous Computing and EducationDelay-tolerant networks (DTN) have the capacity to interconnect devices in roomy regions unlike traditional networks. Based on common sense, the more similar the mobility pattern of nodes, the more stable their relative positions, which results in a ...
Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks
Routing is one of the most challenging development issues in Delay-Tolerant Networks (DTNs) because of lack of continuous connection. Existing routing schemes for DTNs provide best effort service, but are unable to optimize QoS and support message ...
A Novel Time Interval Routing Protocol in Delay Tolerant Networks
NSWCTC '09: Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01Delay-tolerant networks (DTNs) have the capacity to interconnect the devices in roomy regions unlike today’s networks. In this paper, we propose a routing scheme named Time Interval Routing (TIR) to increase deliver ratio and decrease deliver latency in ...
Comments
Information & Contributors
Information
Published In
November 2017
100 pages
ISBN:9781450351669
DOI:10.1145/3134829
- General Chair:
- Isabelle Guérin Lassous,
- Program Chairs:
- Nathalie Mitton,
- Tahiry Razafindralambo
Copyright © 2017 ACM.
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: 21 November 2017
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
MSWiM '17
Sponsor:
MSWiM '17: 20th ACM Int'l Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems
November 21 - 25, 2017
Florida, Miami, USA
Acceptance Rates
Overall Acceptance Rate 70 of 240 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 61Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in