메뉴 건너뛰기




Volumn , Issue , 2012, Pages 5296-5301

Topology design in time-evolving delay-tolerant networks with unreliable links

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY; WIRELESS NETWORKS;

EID: 84877650533     PISSN: 23340983     EISSN: 25766813     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2012.6503962     Document Type: Conference Paper
Times cited : (25)

References (20)
  • 1
    • 70450194687 scopus 로고    scopus 로고
    • Predict and relay: An efficient routing in disruption-tolerant networks
    • Q. Yuan, I. Cardei, and J. Wu, "Predict and relay: an efficient routing in disruption-tolerant networks," in ACM MobiHoc '09, 2009.
    • (2009) ACM MobiHoc '09
    • Yuan, Q.1    Cardei, I.2    Wu, J.3
  • 2
    • 70350667710 scopus 로고    scopus 로고
    • Spray and wait: An efficient routing scheme for intermittently connected mobile networks
    • T. Spyropoulos, et al., "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in ACM WDTN '05, 2005.
    • (2005) ACM WDTN '05
    • Spyropoulos, T.1
  • 3
    • 20344383943 scopus 로고    scopus 로고
    • Probabilistic routing in intermittently connected networks
    • A. Lindgren, A. Doria, O. Schelén, "Probabilistic routing in intermittently connected networks," Mob. Comp. Comm. Rev., 7(3):19-20, 2003.
    • (2003) Mob. Comp. Comm. Rev. , vol.7 , Issue.3 , pp. 19-20
    • Lindgren, A.1    Doria, A.2    Schelén, O.3
  • 4
    • 34347228948 scopus 로고    scopus 로고
    • Evaluating mobility pattern space routing for DTNs
    • J. Leguay, T. Friedman, and V. Conan, "Evaluating mobility pattern space routing for DTNs," in IEEE INFOCOM, 2006.
    • (2006) IEEE INFOCOM
    • Leguay, J.1    Friedman, T.2    Conan, V.3
  • 5
    • 33751032920 scopus 로고    scopus 로고
    • Analysis and implications of student contact patterns derived from campus schedules
    • V. Srinivasan, et al., "Analysis and implications of student contact patterns derived from campus schedules," in ACM Mobicom, 2006.
    • (2006) ACM Mobicom
    • Srinivasan, V.1
  • 6
    • 62949172850 scopus 로고    scopus 로고
    • Social network analysis for routing in disconnected delay-tolerant manets
    • E.M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," in ACM MobiHoc, 2007.
    • (2007) ACM MobiHoc
    • Daly, E.M.1    Haahr, M.2
  • 7
    • 85184298188 scopus 로고    scopus 로고
    • Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing
    • T. Hossmann, et al., "Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing," in IEEE INFOCOM, 2009.
    • (2009) IEEE INFOCOM
    • Hossmann, T.1
  • 8
    • 85184291479 scopus 로고    scopus 로고
    • Topology control for wireless sensor networks, book chapter
    • (eds. Y. Li et al.), Springer
    • Y. Wang, "Topology control for wireless sensor networks," book chapter, Sensor Networks & Applications (eds. Y. Li et al.), Springer, 2007.
    • (2007) Sensor Networks & Applications
    • Wang, Y.1
  • 9
    • 37849041028 scopus 로고    scopus 로고
    • Study of a bus-based disruption-tolerant network: Mobility modeling and impact on routing
    • X. Zhang, J. Kurose, B.N. Levine, D. Towsley, and H. Zhang, "Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing," in ACM MobiCom '07, 2007.
    • (2007) ACM MobiCom '07
    • Zhang, X.1    Kurose, J.2    Levine, B.N.3    Towsley, D.4    Zhang, H.5
  • 10
    • 0037600404 scopus 로고    scopus 로고
    • Delay-tolerant networking: An approach to interplanetary internet
    • S. Burleigh and A. Hooke, "Delay-tolerant networking: an approach to interplanetary internet," IEEE Commun. Mag., 41(6):128-136, 2003.
    • (2003) IEEE Commun. Mag. , vol.41 , Issue.6 , pp. 128-136
    • Burleigh, S.1    Hooke, A.2
  • 11
    • 77149139158 scopus 로고    scopus 로고
    • Limits of predictability in human mobility
    • C. Song, Z. Qu, N. Blumm, and A.-L. Barabasi, "Limits of predictability in human mobility," Science, 327:1018-1021, 2010.
    • (2010) Science , vol.327 , pp. 1018-1021
    • Song, C.1    Qu, Z.2    Blumm, N.3    Barabasi, A.-L.4
  • 12
    • 33748089416 scopus 로고    scopus 로고
    • Routing in space and time in networks with predictable mobility
    • S. Merugu, M. Ammar, and E. Zegura, "Routing in space and time in networks with predictable mobility," GIT, Tech. Rep., CC-04-07, 2004.
    • (2004) GIT, Tech. Rep., CC-04-07
    • Merugu, S.1    Ammar, M.2    Zegura, E.3
  • 13
    • 84877683192 scopus 로고    scopus 로고
    • Topology control for time-evolving and predictable delay-tolerant networks
    • M. Huang, S. Chen, Y. Zhu, et al., "Topology control for time-evolving and predictable delay-tolerant networks," in IEEE MASS, 2011.
    • (2011) IEEE MASS
    • Huang, M.1    Chen, S.2    Zhu, Y.3
  • 14
    • 79551637611 scopus 로고    scopus 로고
    • Cost-efficient topology design problem in time-evolving delay-tolerant networks
    • M. Huang, S. Chen, et al., "Cost-efficient topology design problem in time-evolving delay-tolerant networks," in IEEE Globecom, 2010.
    • (2010) IEEE Globecom
    • Huang, M.1    Chen, S.2
  • 15
    • 77958540270 scopus 로고    scopus 로고
    • A comparative simulation study of link quality estimators in wireless sensor networks
    • N. Baccour, et al., "A comparative simulation study of link quality estimators in wireless sensor networks," in IEEE MASCOTS, 2009.
    • (2009) IEEE MASCOTS
    • Baccour, N.1
  • 16
    • 15844393641 scopus 로고    scopus 로고
    • Mobility prediction in wireless networks
    • W. Su, S. Lee, and M. Gerla, "Mobility prediction in wireless networks," in IEEE MILCOM, 2000.
    • (2000) IEEE MILCOM
    • Su, W.1    Lee, S.2    Gerla, M.3
  • 17
    • 1942450221 scopus 로고    scopus 로고
    • Computing shortest, fastest, and foremost journeys in dynamic networks
    • B.B. Xuan, A. Ferreira, and A. Jarry, "Computing shortest, fastest, and foremost journeys in dynamic networks," Int'l J. of Foundations of Computer Science, 14(2):267-285, 2003.
    • (2003) Int'l J. of Foundations of Computer Science , vol.14 , Issue.2 , pp. 267-285
    • Xuan, B.B.1    Ferreira, A.2    Jarry, A.3
  • 18
    • 0036904559 scopus 로고    scopus 로고
    • An overview of constraint-based path selection algorithms for QoS routing
    • F. A. Kuipers, "An overview of constraint-based path selection algorithms for QoS routing," IEEE Communications Magazine, 50-56, 2002.
    • (2002) IEEE Communications Magazine , pp. 50-56
    • Kuipers, F.A.1
  • 19
    • 0001729130 scopus 로고    scopus 로고
    • A distributed algorithm for delay-constrained unicast routing
    • D. S. Reeves and H. F. Salama, "A distributed algorithm for delay-constrained unicast routing," IEEE/ACM Trans. Netw., 8:239-250, 2000.
    • (2000) IEEE/ACM Trans. Netw. , vol.8 , pp. 239-250
    • Reeves, D.S.1    Salama, H.F.2
  • 20
    • 6444236350 scopus 로고    scopus 로고
    • Performance evaluation of constraint-based path selection algorithms
    • F. Kuipers, T. Korkmaz, et al., "Performance evaluation of constraint-based path selection algorithms," IEEE Network, 18:16-23, 2004
    • (2004) IEEE Network , vol.18 , pp. 16-23
    • Kuipers, F.1    Korkmaz, T.2


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