메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Exploiting network coding for data forwarding in delay tolerant networks

Author keywords

Delay tolerant network (DTN); Network coding; Vehicular ad hoc network (VANET)

Indexed keywords

BUFFER OVERFLOWS; BUS SYSTEMS; DATA DELIVERY; DATA LOSS; DATA TRANSMISSION; DATA-FORWARDING; DELAY TOLERANT NETWORKS; DELIVERY DELAY; DELIVERY RATIO; INTERMEDIATE NODE; INTERMITTENT CONNECTIVITY; LINEAR NETWORK CODING; NETWORK CODING; RESOURCE EFFICIENCIES; SIMULATION RESULT; TRANSMISSION RELIABILITY; VEHICULAR AD HOC NETWORKS;

EID: 77954925621     PISSN: 15502252     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VETECS.2010.5493963     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 1
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic routing for partially connected ad hoc networks
    • Duke Univ.
    • W. Mitchener and A. Vadhaat," Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-2000-2006, Duke Univ., 2000
    • (2000) Technical Report CS-2000-2006
    • Mitchener, W.1    Vadhaat, A.2
  • 2
    • 70350667710 scopus 로고    scopus 로고
    • Spray and Wait: An efficient routing scheme for intermittently connected mobile networks
    • T. Spyropoulos, K. Psounis and C. S. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," ACM WDTN, 2005
    • (2005) ACM WDTN
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3
  • 3
    • 40749157530 scopus 로고    scopus 로고
    • Efficient routing in intermittently connected mobile networks: The single-copy case
    • Feb.
    • T. Spyropoulos, K. Psounis and C. S. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case," IEEE/ACM Transactions on Networking, Vol.16, No.1, Feb. 2008.
    • (2008) IEEE/ACM Transactions on Networking , vol.16 , Issue.1
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3
  • 5
  • 6
    • 20344383943 scopus 로고    scopus 로고
    • Probabilistic routing in intermittently connected networks
    • A. Lindgren, A. Doria and O. Schelen, "Probabilistic Routing in Intermittently Connected Networks," ACM MOBICOM, 2003
    • (2003) ACM MOBICOM
    • Lindgren, A.1    Doria, A.2    Schelen, O.3
  • 9
    • 77954899667 scopus 로고    scopus 로고
    • Performance modeling of network coding in epidemic routing
    • Y. Lin, B. Liang and B. Li, "Performance Modeling of Network Coding in Epidemic Routing" ACM MOBIOPP, 2007
    • (2007) ACM MOBIOPP
    • Lin, Y.1    Liang, B.2    Li, B.3
  • 10
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic routing for parially connected ad-hoc networks
    • Duke University, Apr.
    • A. Vahdat and D. Becker, "Epidemic Routing for Parially Connected Ad-Hoc Networks," Technical Report CS-200006, Duke University, Apr. 2000
    • (2000) Technical Report CS-200006
    • Vahdat, A.1    Becker, D.2
  • 11
    • 34247354200 scopus 로고    scopus 로고
    • Vanetmobisim: Generating realistic mobility patterns for VANETs
    • J. Harri, F. Filali, C. Bonnet and Marco Fiore, "Vanetmobisim: Generating Realistic Mobility Patterns for VANETs," ACM VANET 2006
    • (2006) ACM VANET
    • Harri, J.1    Filali, F.2    Bonnet, C.3    Fiore, M.4


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