메뉴 건너뛰기




Volumn 2015-September, Issue , 2015, Pages 3287-3292

Analysis of hop limit in opportunistic networks by static and time-aggregated graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84953739708     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2015.7248831     Document Type: Conference Paper
Times cited : (11)

References (26)
  • 2
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic routing for partially connected ad hoc networks
    • Duke University, Tech. Rep.
    • A. Vahdat, D. Becker et al., "Epidemic routing for partially connected ad hoc networks," CS-200006, Duke University, Tech. Rep., 2000.
    • (2000) CS-200006
    • Vahdat, A.1    Becker, D.2
  • 3
    • 79960877294 scopus 로고    scopus 로고
    • Hop limited flooding over dynamic networks
    • M. Vojnovic and A. Proutiere, "Hop limited flooding over dynamic networks," in Proceedings IEEE INFOCOM, 2011, pp. 685-693.
    • (2011) Proceedings IEEE INFOCOM , pp. 685-693
    • Vojnovic, M.1    Proutiere, A.2
  • 4
    • 84860532411 scopus 로고    scopus 로고
    • On multicopy opportunistic forwarding protocols in nondeterministic delay tolerant networks
    • C. Liu and J. Wu, "On multicopy opportunistic forwarding protocols in nondeterministic delay tolerant networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 1121-1128, 2012.
    • (2012) IEEE Transactions on Parallel and Distributed Systems , vol.23 , Issue.6 , pp. 1121-1128
    • Liu, C.1    Wu, J.2
  • 8
    • 80052124479 scopus 로고    scopus 로고
    • Bubble rap: Social-based forwarding in delay-tolerant networks
    • P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay-tolerant networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, 2011.
    • (2011) IEEE Transactions on Mobile Computing , vol.10 , Issue.11 , pp. 1576-1589
    • Hui, P.1    Crowcroft, J.2    Yoneki, E.3
  • 9
    • 63049119529 scopus 로고    scopus 로고
    • Social network analysis for information flow in disconnected delay-tolerant MANETs
    • E. M. Daly and M. Haahr, "Social network analysis for information flow in disconnected delay-tolerant MANETs," IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 606-621, 2009.
    • (2009) IEEE Transactions on Mobile Computing , vol.8 , Issue.5 , pp. 606-621
    • Daly, E.M.1    Haahr, M.2
  • 10
    • 77953316363 scopus 로고    scopus 로고
    • Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing
    • T. Hossmann, T. Spyropoulos, and F. Legendre, "Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing," in 2010 Proceedings IEEE INFOCOM, 2010, pp. 1-9.
    • (2010) 2010 Proceedings IEEE INFOCOM , pp. 1-9
    • Hossmann, T.1    Spyropoulos, T.2    Legendre, F.3
  • 14
    • 0036806325 scopus 로고    scopus 로고
    • Computing shortest paths for any number of hops
    • R. Guérin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Transactions on Networking (TON), vol. 10, no. 5, pp. 613-620, 2002.
    • (2002) IEEE/ACM Transactions on Networking (TON) , vol.10 , Issue.5 , pp. 613-620
    • Guérin, R.1    Orda, A.2
  • 15
    • 1242314485 scopus 로고    scopus 로고
    • QoS routing in networks with uncertain parameters
    • D. H. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM Transactions on Networking (TON), vol. 6, no. 6, pp. 768-778, 1998.
    • (1998) IEEE/ACM Transactions on Networking (TON) , vol.6 , Issue.6 , pp. 768-778
    • Lorenz, D.H.1    Orda, A.2
  • 19
    • 84866939709 scopus 로고    scopus 로고
    • Temporal networks
    • P. Holme and J. Saramäki, "Temporal networks," Physics reports, vol. 519, no. 3, pp. 97-125, 2012.
    • (2012) Physics Reports , vol.519 , Issue.3 , pp. 97-125
    • Holme, P.1    Saramäki, J.2
  • 24
    • 84905869515 scopus 로고    scopus 로고
    • Evolutionary network analysis: A survey
    • C. Aggarwal and K. Subbian, "Evolutionary network analysis: A survey," ACM Computing Surveys (CSUR), vol. 47, no. 1, p. 10, 2014.
    • (2014) ACM Computing Surveys (CSUR) , vol.47 , Issue.1 , pp. 10
    • Aggarwal, C.1    Subbian, K.2
  • 26
    • 0000917844 scopus 로고
    • The strength of weak ties: A network theory revisited
    • M. Granovetter, "The strength of weak ties: A network theory revisited," Sociological theory, vol. 1, no. 1, pp. 201-233, 1983.
    • (1983) Sociological Theory , vol.1 , Issue.1 , pp. 201-233
    • Granovetter, M.1


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