메뉴 건너뛰기




Volumn 18, Issue 2, 2010, Pages 596-609

Replication routing in DTNs: A resource allocation approach

Author keywords

Deployment; Design; DTN; Mobility; Performance; Routing; Utility

Indexed keywords

DELIVERY DELAY; DISRUPTION TOLERANT NETWORKS; DTN ROUTING; LIMITED INFORMATION; MOBILITY PERFORMANCE; NETWORK CODING; OPTIMAL PERFORMANCE; REAL TRACE; RESOURCE ALLOCATION PROBLEM; ROUTING METRICS; SMALL LOAD;

EID: 77951105469     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2036365     Document Type: Article
Times cited : (153)

References (35)
  • 1
    • 84870642320 scopus 로고    scopus 로고
    • [Online]
    • "One laptop per child," [Online]. Available: http://www.laptop.org
    • One Laptop per Child
  • 2
    • 84860963048 scopus 로고    scopus 로고
    • UC Berkeley [Online]
    • "TIER project," UC Berkeley [Online]. Available: http://tier.cs. berkeley.edu/
    • TIER Project
  • 4
    • 34548295879 scopus 로고    scopus 로고
    • An energy-efficient architecture for DTN throwboxes
    • DOI 10.1109/INFCOM.2007.96, 4215678, Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
    • N. Banerjee, M. D. Corner, and B. N. Levine, "An energy-efficient architecture for DTN throwboxes," in Proc. IEEEINFOCOM, May 2007, pp. 776-784. (Pubitemid 47334296)
    • (2007) Proceedings - IEEE INFOCOM , pp. 776-784
    • Banerjee, N.1    Corner, M.D.2    Levine, B.N.3
  • 5
    • 60149093585 scopus 로고    scopus 로고
    • Modelling data dissemination in opportunistic networks
    • New York, NY
    • C. Boldrini, M. Conti, and A. Passarella, "Modelling data dissemination in opportunistic networks," in Proc. ACM CHANTS, New York, NY, 2008, pp. 89-96.
    • (2008) Proc. ACM CHANTS , pp. 89-96
    • Boldrini, C.1    Conti, M.2    Passarella, A.3
  • 6
    • 37849034148 scopus 로고    scopus 로고
    • Surviving attacks on disruption-tolerant networks without authentication
    • Sep.
    • J. Burgess, G. Bissias, M. D. Corner, and B. N. Levine, "Surviving attacks on disruption-tolerant networks without authentication," in Proc. ACMMobiHoc, Sep. 2007, pp. 61-70.
    • (2007) Proc. ACMMobiHoc , pp. 61-70
    • Burgess, J.1    Bissias, G.2    Corner, M.D.3    Levine, B.N.4
  • 7
    • 39049118503 scopus 로고    scopus 로고
    • MaxProp: Routing for vehicle-based disruption-tolerant networks
    • Apr.
    • J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "MaxProp: Routing for vehicle-based disruption-tolerant networks," in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-11.
    • (2006) Proc. IEEE INFOCOM , pp. 1-11
    • Burgess, J.1    Gallagher, B.2    Jensen, D.3    Levine, B.N.4
  • 8
    • 25844501977 scopus 로고    scopus 로고
    • MV routing and capacity building in disruption tolerant networks
    • Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
    • B. Burns, O. Brock, and B. N. Levine, "MV routing and capacity building in disruption tolerant networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 398-408. (Pubitemid 41390837)
    • (2005) Proceedings - IEEE INFOCOM , vol.1 , pp. 398-408
    • Burns, B.1    Brock, O.2    Levine, B.N.3
  • 10
    • 39049095674 scopus 로고    scopus 로고
    • Impact of human mobility on the design of opportunistic forwarding algorithms
    • Apr.
    • A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of human mobility on the design of opportunistic forwarding algorithms," in Proc. IEEE INFOCOM, Apr. 2006, pp. 1-13.
    • (2006) Proc. IEEE INFOCOM , pp. 1-13
    • Chaintreau, A.1    Hui, P.2    Crowcroft, J.3    Diot, C.4    Gass, R.5    Scott, J.6
  • 11
    • 33746352017 scopus 로고    scopus 로고
    • An 0(i/(n)) approximation and integrality gap for disjoint paths and unsplittable flow
    • C. Chekuri, S. Khanna, andF. B. Shepherd, "An 0(i/(n)) approximation and integrality gap for disjoint paths and unsplittable flow," Theory Comput., vol.2, no.7, pp. 137-146, 2006.
    • (2006) Theory Comput. , vol.2 , Issue.7 , pp. 137-146
    • Chekuri, C.1    Khanna, S.2    Shepherd, F.B.3
  • 12
    • 77951137179 scopus 로고    scopus 로고
    • [Online]
    • "CPLEX," [Online]. Available: http://www.ilog.com
    • CPLEX
  • 15
    • 0032669862 scopus 로고    scopus 로고
    • Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
    • V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yan-nakakis, "Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems," in Proc. ACM STOC, 1999, pp. 19-28.
    • (1999) Proc. ACM STOC , pp. 19-28
    • Guruswami, V.1    Khanna, S.2    Rajaraman, R.3    Shepherd, B.4    Yan-Nakakis, M.5
  • 17
    • 33847286107 scopus 로고    scopus 로고
    • Using redundancy to cope with failures in a delay tolerant network
    • DOI 10.1145/1090191.1080106
    • S. Jain, M. Demmer, R. Patra, and K. Fall, "Using redundancy to cope with failures in a delay tolerant network," in Proc. ACM SIGCOMM, Aug. 2005, pp. 109-120. (Pubitemid 46323498)
    • (2005) Computer Communication Review , vol.35 , Issue.4 , pp. 109-120
    • Jain, S.1    Demmer, M.2    Patra, R.3    Fall, K.4
  • 18
    • 21844451437 scopus 로고    scopus 로고
    • Routing in a delay tolerant network
    • Aug.
    • S. Jain, K. Fall, and R. Patra, "Routing in a delay tolerant network," in Proc. ACM SIGCOMM, Aug. 2004, pp. 145-158.
    • (2004) Proc. ACM SIGCOMM , pp. 145-158
    • Jain, S.1    Fall, K.2    Patra, R.3
  • 19
    • 29244436117 scopus 로고    scopus 로고
    • Practical routing in delay-tolerant networks
    • Aug.
    • E. Jones, L. Li, and P. Ward, "Practical routing in delay-tolerant networks," in Proc. ACM CHANTS, Aug. 2005, pp. 237-243.
    • (2005) Proc. ACM CHANTS , pp. 237-243
    • Jones, E.1    Li, L.2    Ward, P.3
  • 20
    • 84885716360 scopus 로고    scopus 로고
    • DTN routing in a mobility pattern space
    • Aug.
    • J. Leguay, T. Friedman, and V. Conan, "DTN routing in a mobility pattern space," in Proc. ACM CHANTS, Aug. 2005, pp. 276-283.
    • (2005) Proc. ACM CHANTS , pp. 276-283
    • Leguay, J.1    Friedman, T.2    Conan, V.3
  • 21
    • 34347251103 scopus 로고    scopus 로고
    • Probabilistic routing in intermittently connected networks
    • Aug.
    • A. Lindgren, A. Doria, and O. Schelén, "Probabilistic routing in intermittently connected networks," in Proc. SAPIR Workshop, Aug. 2004, pp. 239-254.
    • (2004) Proc. SAPIR Workshop , pp. 239-254
    • Lindgren, A.1    Doria, A.2    Schelén, O.3
  • 24
    • 25844469166 scopus 로고    scopus 로고
    • A disconnection-tolerant transport for drive-thru Internet environments
    • Mar.
    • J. Ott and D. Kutscher, "A disconnection-tolerant transport for drive-thru Internet environments," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1849-1862.
    • (2005) Proc. IEEE INFOCOM , pp. 1849-1862
    • Ott, J.1    Kutscher, D.2
  • 26
    • 34247377791 scopus 로고    scopus 로고
    • A survey of practical issues in underwater networks
    • Sep.
    • J. Partan, J. Kurose, and B. N. Levine, "A survey of practical issues in underwater networks," in Proc. ACM WUWNet, Sep. 2006, pp. 17-24.
    • (2006) Proc. ACM WUWNet , pp. 17-24
    • Partan, J.1    Kurose, J.2    Levine, B.N.3
  • 27
    • 84942436269 scopus 로고    scopus 로고
    • Data MULEs: Modeling a three-tier architecture for sparse sensor networks
    • May
    • R. C. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a three-tier architecture for sparse sensor networks," in Proc. IEEE SNPA, May 2003, pp. 30-41.
    • (2003) Proc. IEEE SNPA , pp. 30-41
    • Shah, R.C.1    Roy, S.2    Jain, S.3    Brunette, W.4
  • 29
    • 29244491141 scopus 로고    scopus 로고
    • Spray and wait: An efficient routing scheme for intermittently connected mobile networks
    • Aug.
    • T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. ACM WDTN, Aug. 2005, pp. 252-259.
    • (2005) Proc. ACM WDTN , pp. 252-259
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.S.3
  • 31
    • 20344379431 scopus 로고    scopus 로고
    • Single-copy routing in intermittently connected mobile networks
    • Oct.
    • T. Spyropoulos, K. Psounis, and C. Raghavendra, "Single-copy routing in intermittently connected mobile networks," in Proc. IEEE SECON, Oct. 2004, pp. 235-244.
    • (2004) Proc. IEEE SECON , pp. 235-244
    • Spyropoulos, T.1    Psounis, K.2    Raghavendra, C.3
  • 32
    • 29244455024 scopus 로고    scopus 로고
    • Network coding for efficient communication in extreme networks
    • Aug.
    • J. Widmer and J.-Y. Le Boudec, "Network coding for efficient communication in extreme networks," in Proc. ACM WDTN, Aug. 2005, pp. 284-291.
    • (2005) Proc. ACM WDTN , pp. 284-291
    • Widmer, J.1    Le Boudec, J.-Y.2
  • 33
    • 0036498659 scopus 로고    scopus 로고
    • The broadcast storm problem in a mobile ad hoc network
    • Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, "The broadcast storm problem in a mobile ad hoc network," Wireless Netw., vol. 8, no. 2/3, pp. 153-167, 2002.
    • (2002) Wireless Netw. , vol.8 , Issue.2-3 , pp. 153-167
    • Tseng, Y.-C.1    Ni, S.-Y.2    Chen, Y.-S.3    Sheu, J.-P.4


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