메뉴 건너뛰기




Volumn , Issue , 2009, Pages 121-147

Routing issues in opportunistic networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84892017387     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-89707-1_6     Document Type: Chapter
Times cited : (24)

References (4)
  • 1
    • 84892097063 scopus 로고    scopus 로고
    • As will be clear in the following, in opportunistic networks the routing and forwarding tasks are strictly intertwined and usually performed at the same time. Therefore, hereafter we use the terms routing and forwarding interchangeably
    • As will be clear in the following, in opportunistic networks the routing and forwarding tasks are strictly intertwined and usually performed at the same time. Therefore, hereafter we use the terms routing and forwarding interchangeably.
  • 2
    • 84892105655 scopus 로고    scopus 로고
    • We do not discuss here opportunistic network applications, as this chapter is mainly centred on the networking and routing aspects of opportunistic networks. The interested readers can find more information about the application aspects on the Haggle project web site: www.haggleproject.org
    • Opportunistic Network Applications
  • 3
    • 84891976924 scopus 로고    scopus 로고
    • Two weeks seems to be very long, but as we have mentioned before, the Reality network is very sparse. we choose it mainly because it has long experimental period and hence more reliable community structures can be inferred. The evaluations here can serve as a proof of concept of the Bubble algorithm, although the delays are large in this dataset. Delay in other datasets are much lower; for example in Infocom05, the median delay is 3 hours.
    • Reality Network
  • 4
    • 84892098771 scopus 로고    scopus 로고
    • The update of the ranking has a much lower cost. As we presented in [392], it can be approximatedby a exponential smoothing function of its past contact history
    • The update of the ranking has a much lower cost. As we presented in [392], it can be approximatedby a exponential smoothing function of its past contact history.


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