107
Views
2
CrossRef citations to date
0
Altmetric
Articles

Social contact graph-based group communication schemes for delay tolerant networks

&
Pages 380-394 | Received 03 Nov 2016, Accepted 23 Feb 2017, Published online: 15 Mar 2017

References

  • Fall K. A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications; Karlsruhe. New York (NY): ACM; 2003. p. 27–34.
  • Juang P, Oki H, Wang Y, et al. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. Vol. 37, ACM sigplan notices; San Jose, CA. New York (NY): ACM; 2002. p. 96–107.
  • Tovar A, Friesen T, Ferens K, et al. A DTN wireless sensor network for wildlife habitat monitoring. 23rd Canadian Conference on Electrical and Computer Engineering (CCECE). Calgary (Al): IEEE; 2010. p. 1–5.
  • Motani M, Srinivasan V, Nuggehalli PS. Peoplenet: engineering a wireless virtual social network. In: Proceedings of the 11th annual international conference on Mobile computing and networking; Cologn. New York (NY): ACM; 2005. p. 243–257
  • Partan J, Kurose J, Levine BN. A survey of practical issues in underwater networks. ACM SIGMOBILE Mobile Comput Commun Rev. 2007;11:23–33.
  • Park S, Kim S, Yoo Y. Dtn routing protocol utilizing underwater channel properties in underwater wireless sensor networks. J Korean Inst Commun Inf Sci. 2014;39:645–653.
  • Lu Z, Fan J. Delay/disruption tolerant network and its application in military communications. 2010 International Conference on Computer Design and Applications (ICCDA); Qinhuangdao. Vol. 5, Qinhuangdao: IEEE; 2010. p. V5–231.
  • Amin R, Ripplinger D, Mehta D, et al. Design considerations in applying disruption tolerant networking to tactical edge networks. IEEE Commun Mag. 2015;53:32–38.
  • Ott J, Kutscher D. A disconnection-tolerant transport for drive-thru internet environments. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005; Miami. Vol. 3, Miami (FL): IEEE; 2005. p. 1849–1862.
  • Wu C, Ji Y, Ohzahata S, et al. Can DTN improve the performance of vehicle-to-roadside communication? 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). Hong Kong: IEEE; 2015. p. 1934–1939.
  • Zhao W, Ammar M, Zegura E. Multicasting in delay tolerant networks: semantic models and routing algorithms. In: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking; Philadelphia, PA. New York (NY): ACM; 2005. p. 268–275
  • Ye Q, Cheng L, Chuah MC, Davison BD. OS-multicast: on-demand situation-aware multicasting in disruption tolerant networks. Vol. 1, IEEE 63rd Vehicular Technology Conference, 2006, VTC 2006-Spring. Melbourne (VIC): IEEE; 2006. p. 96–100.
  • Xi Y, Chuah MC. An encounter-based multicast scheme for disruption tolerant networks. Comput Commun. 2009;32:1742–1756.
  • Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Comput Commun Rev. 2003;7:19–20.
  • Lee U, Oh SY, Lee KW, et al. Relaycast: scalable multicast routing in delay tolerant networks. IEEE International Conference on Network Protocols, 2008. ICNP 2008. Orlando (FL): IEEE; 2008, p.218–227.
  • Gao W, Li Q, Zhao B, et al. Multicasting in delay tolerant networks: a social network perspective. In: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing; New Orleans, LA. New York (NY): ACM; 2009. p. 299–308. doi: 10.1145/1530748.1530790
  • Mongiovi M, Singh AK, Yan X, Zong B, Psounis K. Efficient multicasting for delay tolerant networks using graph indexing. In: Proceedings of IEEE INFOCOM. IEEE; 2012, p.1386–1394.
  • Wang Y, Wu J. A dynamic multicast tree based routing scheme without replication in delay tolerant networks. J Parallel Distrib Comput. 2012;72:424–436.
  • Lo SC, Luo NW, Gao JS, et al. Quota-based multicast routing in delay-tolerant networks. Wireless Pers Commun. 2014;74:1329–1344.
  • Jiang G, Chen J, Shen Y. Delivery ratio-and buffered time-constrained: Multicasting for delay tolerant networks. J Netw Comput Appl. 2014;44:92–105.
  • Nelson SC, Kravets R. Achieving anycast in DTNs by enhancing existing unicast protocols. In: Proceedings of the 5th ACM Workshop on Challenged Networks, CHANTS ’10. New York (NY): ACM; 2010. p. 63–70.
  • Gong Y, Xiong Y, Zhang Q, et al. WSN12-3: anycast routing in delay tolerant networks. Global Telecommunications Conference, 2006. GLOBECOM’06. San Francisco (CA): IEEE; 2006. p. 1–5.
  • Xiao M, Huang L, Liu A, et al. Anycast routing in probabilistically contacted delay tolerant networks. Vol. 3, 2010 International Conference on Communications and Mobile Computing (CMC). IEEE; 2010. p. 442–446
  • Silvada ER, Guardieiro PR. Anycast routing in delay tolerant networks using genetic algorithms for route decision. 11th International Conference on Computer and Information Technology 2008, ICCIT 2008. 2008. p. 65–71.
  • Daly EM, Haahr M. Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Trans Mobile Comput. 2009;8:606–621.
  • Xia F, Liu L, Li J, et al. Socially aware networking: a survey. IEEE Com Soc. 2015;9:904–921.
  • Hochbaum DS. Approximation algorithms for NP-hard problems. Boston (MA): PWS Publishing Co.; 1996.
  • Liben-Nowell D, Novak J, Kumar R, et al. Geographic routing in social networks. Proc Nat Acad Sci USA. 2005;102:11623–11628.
  • Cabspotting [Accessed: 2015 March]. Available from:http://cabspotting.org/.
  • Wang Y, Zhang P, Liu T, et al. CRAWDAD dataset princeton/zebranet (v. 2007–02-14). Traceset: movement, Downloaded from: http://crawdad.org/princeton/zebranet/20070214/movement
  • Lakkakorpi J, Ginzboorg P. ns-3 Module for routing and congestion control studies in mobile opportunistic DTNs. International Symposium on Performance Evaluation of Computer and Telecommunication Systems; Toronto (ON): IEEE; 2013. p. 46–50.
  • Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks SIGMOBILE Mob. Comput. Commun. Rev. 2004. p. 19–20. doi: 10.1145/961268.961272
  • Vahdat A, Becker D, et al. Epidemic routing for partially connected ad hoc networks, Technical Report. Durham (NC): Duke University; 2000. (Technical Report CS-200006).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.