Abstract
In particular types of Delay-Tolerant Networks (DTN) such as Opportunistic Mobile Networks, node connectivity is transient. For this reason, traditional routing mechanisms are no longer suitable. New approaches use social relations between mobile users as a criterion for the routing process. We argue that in such an approach, nodes with high social popularity may become congested. We show that social-based routing algorithms such as Bubble Rap are prone to congestion, and introduce two algorithms Outer and LowerEps. We present experimental results showing that the latter outperform Bubble Rap and solve the congestion problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cisco visual networking index: Global mobile data traffic forecast update (2011-2016), http://www.cisco.com/
Asandei, A.: Socio-aware routing in opportunistic networks. Bachelor Thesis
Bjurefors, F., Gunningberg, P., et al.: Congestion avoidance in a data-centric opportunistic network. In: Proc. of the ACM SIGCOMM Workshop on Information-Centric Networking, ICN 2011, New York, USA, pp. 32–37 (2011)
Boldrini, C., Conti, M., Passarella, A.: Exploiting users and social relations to forward data in opportunistic networks: The hibop solution. Pervasive and Mobile Computing 4(5), 633–657 (2008)
Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw. 10(4), 477–486 (2002)
Huberman, B.A., Romero, D.M., Wu, F.: Social networks that matter: Twitter under the microscope. CoRR, vol. abs/0812.1045 (December 5, 2008), http://ssrn.com/abstract=1313405
Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay tolerant networks. In: Proc. of the 9th ACM Int. Symp. on Mobile Ad Hoc Net. and Comp., MobiHoc 2008, pp. 241–250. ACM, New York (2008)
Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proc. of the 2004 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Comm., SIGCOMM 2004, pp. 145–158. ACM, New York (2004)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)
Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Magazine 44(11), 134–141 (2006)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000006, Duke University, Durham, NC (December 2000)
Wilson, C., Boe, B., et al.: User interactions in social networks and their implications. In: Proc. of the 4th ACM Eu. Conf. on Computer Systems, EuroSys 2009, pp. 205–218. ACM, New York (2009)
Wortham, J.: Customers Angered as iPhones Overload AT&T, The New York Times (September 2, 2009), http://www.nytimes.com/2009/09/03/technology (accessed November 2, 2012)
Xu, K., Hui, P., et al.: Impact of altruism on opportunistic communications. In: Proc. of the First Int. Conf. on Ubiquitous and Future Networks, ICUFN 2009, pp. 153–158. IEEE Press, Piscataway (2009)
Yoneki, E., Hui, P., Chan, S., Crowcroft, J.: A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In: Proc. of the 10th ACM Symp. on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM 2007, pp. 225–234. ACM, New York (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asandei, A., Dobre, C., Popovici, M. (2013). Social-Based Routing with Congestion Avoidance in Opportunistic Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)