메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Optimal constrained candidate selection for opportunistic routing

Author keywords

Ad hoc networks; Candidate selection; Constrained candidate set size; Opportunistic routing

Indexed keywords

NETWORK ROUTING;

EID: 79551643587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2010.5683490     Document Type: Conference Paper
Times cited : (24)

References (11)
  • 2
    • 74149090206 scopus 로고    scopus 로고
    • Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
    • R. Bruno and M. Nurchis, "Survey on diversity-based routing in wireless mesh networks: Challenges and solutions," Computer Communications, vol. 33, no. 3, pp. 269-282, 2010.
    • (2010) Computer Communications , vol.33 , Issue.3 , pp. 269-282
    • Bruno, R.1    Nurchis, M.2
  • 6
    • 70349229502 scopus 로고    scopus 로고
    • Efficient opportunistic routing in utility-based ad hoc networks
    • sept.
    • M. Lu, F. Li, and J. Wu, "Efficient opportunistic routing in utility-based ad hoc networks," Reliability, IEEE Transactions on, vol. 58, no. 3, pp. 485-495, sept. 2009.
    • (2009) Reliability, IEEE Transactions on , vol.58 , Issue.3 , pp. 485-495
    • Lu, M.1    Li, F.2    Wu, J.3


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