메뉴 건너뛰기




Volumn , Issue , 2008, Pages 55-63

Latency of opportunistic forwarding in finite regular wireless networks

Author keywords

Opportunistic forwarding; Random walk on finite graphs; Wireless ad hoc and sensor networks

Indexed keywords

ANALYTICAL RESULTS; END-TO-END LATENCY; GLOBAL TOPOLOGY; GRID-LIKE; HITTING TIME; INTERMEDIATE NODE; LOCAL INFORMATION; MODEL VARIABLES; OPPORTUNISTIC FORWARDING; RANDOM WALK; RANDOM WALK ON FINITE GRAPHS; REGULAR NETWORKS; WIRELESS AD HOC AND SENSOR NETWORKS; WIRELESS TRANSMISSIONS;

EID: 65249158438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400863.1400875     Document Type: Conference Paper
Times cited : (5)

References (8)
  • 1
    • 34248512089 scopus 로고    scopus 로고
    • On the cover time and mixing time of random geometric graphs
    • June
    • C. Avin and G. Ercal, "On the cover time and mixing time of random geometric graphs," Theoretical Computer Science, vol. 380, pp. 2-22, June 2007.
    • (2007) Theoretical Computer Science , vol.380 , pp. 2-22
    • Avin, C.1    Ercal, G.2
  • 3
    • 65249150702 scopus 로고    scopus 로고
    • R. B. Ellis, Discrete green's functions for products of regular graphs, 2003, arXiv:math/0309080v2.
    • R. B. Ellis, "Discrete green's functions for products of regular graphs," 2003, arXiv:math/0309080v2.
  • 5
    • 34047144703 scopus 로고    scopus 로고
    • Markov chains and mixing times
    • lecture notes
    • D. A. Levin, Y. Peres, and E. L. Wilmer, "Markov chains and mixing times," http://www.oberlin.edu/markov/, 2006, lecture notes.
    • (2006)
    • Levin, D.A.1    Peres, Y.2    Wilmer, E.L.3
  • 6
    • 0003514340 scopus 로고    scopus 로고
    • Reversible Markov chains and random walks on graphs
    • lecture notes
    • D. Aldous and J. A. Fill, "Reversible Markov chains and random walks on graphs," http://www.stat.berkeley.edu/~aldous/RWG/book.html, 1999, lecture notes.
    • (1999)
    • Aldous, D.1    Fill, J.A.2


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