More Web Proxy on the site http://driver.im/

research-article

Considering Multi-Contact Encounters in Opportunistic Networks

Authors:

Hjalmar Wennerström,

Christian Rohner,

David SmithAuthors Info & Claims

CHANTS '15: Proceedings of the 10th ACM MobiCom Workshop on Challenged Networks

Pages 13 - 18

https://doi.org/10.1145/2799371.2799378

Published: 11 September 2015 Publication History

Abstract

Opportunistic networks, often characterized by their intermittent connectivity and sparsity of nodes, has sparked routing in these networks to focus on isolated contact opportunities. Routing has predominantly been viewed as an exchange of messages between a pair of nodes. In this paper, we take a new look at contact opportunities, specifically focusing on the occurrence of having multiple simultaneous node contacts. Multi-contact encounters warrants a more holistic view of routing decisions, where more factors than just the features of a message-node tuple can be considered. We discuss these aspects and propose a protocol addition to leverage multi-contact opportunities with the notion of heterogeneous link quality, in order to limit energy consumption. The approach, implemented for the Epidemic, Spray-and-Wait and PRoPHETv2 protocols, re-evaluates routing decisions, weighting the routing metrics value against the estimated cost of the relay. Results indicate a two to three fold decrease in the number of messages lost, as well as a reduction in message relays, while maintaining a high delivery ratio for all three protocols.

References

[1]

N. Baccour et al. Radio link quality estimation in wireless sensor networks: A survey. ACM Trans. Sen. Netw., 2012.

Digital Library

[2]

J. Burgess, B. Gallagher, D. Jensen, and B. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In INFOCOM '06.

[3]

N. Eagle and A. S. Pentland. CRAWDAD data set mit/reality (v. 2005-07-01). Downloaded from http://crawdad.org/mit/reality/, 2005.

[4]

S. Grasic, E. Davies, A. Lindgren, and A. Doria. The evolution of a dtn routing protocol - prophetv2. In CHANTS '11.

Digital Library

[5]

P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot. Pocket switched networks and human mobility in conference environments. In WDTN '05.

Digital Library

[6]

A. Keranen, J. Ott, and T. K\"arkk\"ainen. The one simulator for dtn protocol evaluation. In Simutools '09, 2009.

Digital Library

[7]

C. P. Mayer. osm2wkt - openstreetmap to well-known-text conversion. http://www.tm.kit.edu/mayer/osm2wkt, 2010.

[8]

M. Newman. Detecting community structure in networks. The European Physical Journal B - Condensed Matter and Complex Systems, 2004.

[9]

J. Ott, D. Kutscher, and C. Dwertmann. Integrating dtn and manet routing. In CHANTS '06.

Digital Library

[10]

T. S. Rappaport et al. Wireless communications: principles and practice. prentice hall PTR New Jersey, 1996.

Digital Library

[11]

S. Saunders and A. Aragón-Zavala. Antennas and propagation for wireless communication systems. John Wiley & Sons, 2007.

Digital Library

[12]

J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-01--31). Downloaded from http://crawdad.org/cambridge/haggle/, 2006.

[13]

T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In WDTN '05.

Digital Library

[14]

P. Tournoux, J. Leguay, F. Benbadis, J. Whitbeck, V. Conan, and M. Dias de Amorim. Density-aware routing in highly dynamic dtns: The rollernet case. Mobile Computing, IEEE Transactions on, 2011.

Digital Library

[15]

A. Vahdat, D. Becker, et al. Epidemic routing for partially connected ad hoc networks. Technical report, Technical Report CS-200006, Duke University, 2000.

[16]

J. Whitbeck and V. Conan. Hymad: Hybrid dtn-manet routing for dense and highly dynamic wireless networks. Computer Communications, 2010.

Digital Library

Cited By

Dhurandher SWoungang ISingh JBorah S(2019)Energy aware routing for efficient green communication in opportunistic networksIET Networks10.1049/iet-net.2018.51068:4(272-279)Online publication date: Jul-2019
https://doi.org/10.1049/iet-net.2018.5106
Kuchhal PDhurandher SWoungang IKumar VJain SGupta SBarolli L(2019)Pareto set based optimized routing in opportunistic networkJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-019-01337-8Online publication date: 6-Jun-2019
https://doi.org/10.1007/s12652-019-01337-8
Dhurandher SBorah SWoungang ITibarewal SBarolli L(2018)DEEPJournal of High Speed Networks10.3233/JHS-18058524:2(119-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/JHS-180585
Show More Cited By

Index Terms

Considering Multi-Contact Encounters in Opportunistic Networks
1. Networks
  1. Network types

Recommendations

Energy-efficient opportunistic topology control in wireless sensor networks
MobiOpp '07: Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking

Topology control has been proposed as a promising technique to achieve energy-efficiency in wireless sensor networks (WSNs). However, existing topology control algorithms assume that wireless links are static, either connected or disconnected. Taking ...
Adaptive routing in mobile opportunistic networks
MSWIM '10: Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems

In this paper, we study how to adapt the routing according to dynamic network conditions in wireless ad hoc networks. We present a method that dynamically chooses routing agent between ad hoc on-demand distance vector routing protocol (AODV) with TCP (...
An Opportunistic Network Coding Routing for Opportunistic Networks

In opportunistic networks (OppNets), instead of assuming a complete path, messages are exchanged opportunistically when two nodes encounter. To support efficient and reliable end-to-end messaging in OppNets, a number of routing protocols based on ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

CHANTS '15: Proceedings of the 10th ACM MobiCom Workshop on Challenged Networks

September 2015

74 pages

ISBN:9781450335430

DOI:10.1145/2799371

Program Chairs:
Katia Obraczka
UC Santa Cruz, USA
,
Karin Anna Hummel
ETH Zurich, Switzerland

Copyright © 2015 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 the author(s) 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

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 September 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MobiCom'15

Sponsor:

SIGMOBILE

MobiCom'15: The 21th Annual International Conference on Mobile Computing and Networking

September 11, 2015

Paris, France

Acceptance Rates

CHANTS '15 Paper Acceptance Rate 7 of 27 submissions, 26%;

Overall Acceptance Rate 61 of 159 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
175
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dhurandher SWoungang ISingh JBorah S(2019)Energy aware routing for efficient green communication in opportunistic networksIET Networks10.1049/iet-net.2018.51068:4(272-279)Online publication date: Jul-2019
https://doi.org/10.1049/iet-net.2018.5106
Kuchhal PDhurandher SWoungang IKumar VJain SGupta SBarolli L(2019)Pareto set based optimized routing in opportunistic networkJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-019-01337-8Online publication date: 6-Jun-2019
https://doi.org/10.1007/s12652-019-01337-8
Dhurandher SBorah SWoungang ITibarewal SBarolli L(2018)DEEPJournal of High Speed Networks10.3233/JHS-18058524:2(119-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/JHS-180585
Krug SAumüller MSeitz J(2018)Hybrid scheme to enable DTN routing protocols to efficiently exploit stable MANET contactsEURASIP Journal on Wireless Communications and Networking10.1186/s13638-018-1248-52018:1Online publication date: 10-Oct-2018
https://doi.org/10.1186/s13638-018-1248-5
Borah SDhurandher SWoungang IKandhoul NRodrigues J(2018)An Energy-Efficient Location Prediction-Based Forwarding Scheme for Opportunistic Networks2018 IEEE International Conference on Communications (ICC)10.1109/ICC.2018.8422305(1-6)Online publication date: May-2018
https://doi.org/10.1109/ICC.2018.8422305
Mao ZJiang Y(2017)Fair airtime allocation for content dissemination in WiFi-direct-based mobile social networks2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292611(1-7)Online publication date: Oct-2017
https://doi.org/10.1109/PIMRC.2017.8292611
Borah SDhurandher STibarewala SWoungang IObaidat M(2017)Energy-Efficient Prophet-PRoWait-EDR Protocols for Opportunistic NetworksGLOBECOM 2017 - 2017 IEEE Global Communications Conference10.1109/GLOCOM.2017.8254434(1-6)Online publication date: Dec-2017
https://doi.org/10.1109/GLOCOM.2017.8254434

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents