메뉴 건너뛰기




Volumn 2015-October, Issue , 2015, Pages

Exploiting active sub-areas for multi-copy routing in VDTNs

Author keywords

Active area; Routing algorithm; VDTN

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DELAY TOLERANT NETWORKS; ROUTING ALGORITHMS;

EID: 84959386357     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2015.7288409     Document Type: Conference Paper
Times cited : (13)

References (18)
  • 3
    • 84863557470 scopus 로고    scopus 로고
    • Encounter based sensor tracking
    • ACM
    • A. Symington and N. Trigoni, Encounter based sensor tracking., in Proc. of MobiHoc, pp. 15-24, ACM, 2012
    • (2012) Proc. of MobiHoc , pp. 15-24
    • Symington, A.1    Trigoni, N.2
  • 4
    • 79960860837 scopus 로고    scopus 로고
    • Exploiting temporal dependency for opportunistic forwarding in urban vehicular networks
    • H. Zhu, S. Chang, M. Li, K. Naik, and S. X. Shen, Exploiting temporal dependency for opportunistic forwarding in urban vehicular networks., in Proc. of INFOCOM, IEEE, 2011
    • (2011) Proc. of INFOCOM, IEEE
    • Zhu, H.1    Chang, S.2    Li, M.3    Naik, K.4    Shen, S.X.5
  • 5
    • 77953306838 scopus 로고    scopus 로고
    • Peoplerank: Social opportunistic forwarding
    • IEEE
    • A. Mtibaa, M. May, C. Diot, and M. H. Ammar, Peoplerank: Social opportunistic forwarding., in Proc. of INFOCOM, pp. 111-115, IEEE, 2010
    • (2010) Proc. of INFOCOM , pp. 111-115
    • Mtibaa, A.1    May, M.2    Diot, C.3    Ammar, M.H.4
  • 6
    • 37849017498 scopus 로고    scopus 로고
    • Social network analysis for routing in disconnected delay-tolerant manets
    • ACM
    • E. M. Daly and M. Haahr, Social network analysis for routing in disconnected delay-tolerant manets., in Proc. of MobiHoc, pp. 32-40, ACM, 2007
    • (2007) Proc. of MobiHoc , pp. 32-40
    • Daly, E.M.1    Haahr, M.2
  • 7
    • 80052124479 scopus 로고    scopus 로고
    • Bubble rap: Socialbased forwarding in delay-tolerant networks
    • P. Hui, J. Crowcroft, and E. Yoneki, Bubble rap: Socialbased forwarding in delay-tolerant networks., IEEE Trans. Mob. Comput., vol. 10, no. 11, pp. 1576-1589, 2011
    • (2011) IEEE Trans. Mob. Comput , vol.10 , Issue.11 , pp. 1576-1589
    • Hui, P.1    Crowcroft, J.2    Yoneki, E.3
  • 8
    • 47749113660 scopus 로고    scopus 로고
    • Geopps: Geographical opportunistic routing for vehicular networks
    • IEEE
    • I. Leontiadis and C. Mascolo, Geopps: Geographical opportunistic routing for vehicular networks., in Proc. of WOWMOM, pp. 1-6, IEEE, 2007
    • (2007) Proc. of WOWMOM , pp. 1-6
    • Leontiadis, I.1    Mascolo, C.2
  • 9
    • 84857203560 scopus 로고    scopus 로고
    • Geodtn: Geographic routing in disruption tolerant networks
    • IEEE
    • J. g. B. Link, D. Schmitz, and K. Wehrle, Geodtn: Geographic routing in disruption tolerant networks., in Proc. of GLOBECOM, pp. 1-5, IEEE, 2011
    • (2011) Proc. of GLOBECOM , pp. 1-5
    • Link, J.G.B.1    Schmitz, D.2    Wehrle, K.3
  • 10
    • 79960867822 scopus 로고    scopus 로고
    • Trajectory improves data delivery in vehicular networks
    • IEEE
    • Y. Wu, Y. Zhu, Trajectory improves data delivery in vehicular networks., in Proc. of Infocom, pp. 2183-2191, IEEE, 2011
    • (2011) Proc. of Infocom , pp. 2183-2191
    • Wu, Y.1    Zhu, Y.2
  • 11
    • 84884852229 scopus 로고    scopus 로고
    • Dtn-flow: Inter-landmark data flow for high-throughput routing in dtns
    • IEEE
    • K. Chen and H. Shen, Dtn-flow: Inter-landmark data flow for high-throughput routing in dtns., in Proc. of IPDPS, pp. 726-737, IEEE, 2013
    • (2013) Proc. of IPDPS , pp. 726-737
    • Chen, K.1    Shen, H.2
  • 14
    • 77953316363 scopus 로고    scopus 로고
    • Know thy neighbor: Towards optimal mapping of contacts to social graphs for dtn routing
    • IEEE
    • T. Hossmann, T. Spyropoulos, and F. Legendre, Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing., in Proc. of INFOCOM, pp. 866-874, IEEE, 2010
    • (2010) Proc. of INFOCOM , pp. 866-874
    • Hossmann, T.1    Spyropoulos, T.2    Legendre, F.3
  • 15
    • 40749113163 scopus 로고    scopus 로고
    • Efficient routing in intermittently connected mobile networks: The multiple-copy case
    • T. Spyropoulos, K. Psounis, and C. S. Raghavendra, Efficient routing in intermittently connected mobile networks: the multiple-copy case., IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 77-90, 2008
    • (2008) IEEE/ACM Trans. Netw , vol.16 , Issue.1 , pp. 77-90
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3
  • 16
    • 77954399768 scopus 로고    scopus 로고
    • An efficient control method of multi-copy routing in DTN
    • IEEE
    • B. Hong and Y. Haizheng, An Efficient Control Method of Multi-copy Routing in DTN., in Proc. of NSWCTC, pp. 153-156, IEEE, 2010
    • (2010) Proc. of NSWCTC , pp. 153-156
    • Hong, B.1    Haizheng, Y.2
  • 17
    • 70449574102 scopus 로고    scopus 로고
    • A low-energy, multi-copy inter-contact routing protocol for disaster response networks
    • IEEE
    • M. Y. S. Uddin, H. Ahmadi, T. F. Abdelzaher, and R. Kravets, A low-energy, multi-copy inter-contact routing protocol for disaster response networks., in Proc. of SECON, pp. 1-9, IEEE, 2009
    • (2009) Proc. of SECON , pp. 1-9
    • Uddin, M.Y.S.1    Ahmadi, H.2    Abdelzaher, T.F.3    Kravets, R.4
  • 18
    • 84862916353 scopus 로고    scopus 로고
    • Buffer and switch: An efficient road-to-road routing scheme for vanets
    • IEEE
    • C. Song, M. Liu, Y. Wen, J. Cao, and G. Chen, Buffer and switch: An efficient road-to-road routing scheme for vanets., in Proc. of MSN, pp. 310-317, IEEE, 2011
    • (2011) Proc. of MSN , pp. 310-317
    • Song, C.1    Liu, M.2    Wen, Y.3    Cao, J.4    Chen, G.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.