完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLian, Huai-Enen_US
dc.contributor.authorChen, Chienen_US
dc.contributor.authorChang, Je-Weien_US
dc.contributor.authorShen, Chien-Chungen_US
dc.contributor.authorJan, Rong-Hongen_US
dc.date.accessioned2014-12-08T15:20:40Z-
dc.date.available2014-12-08T15:20:40Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-5160-9en_US
dc.identifier.urihttp://hdl.handle.net/11536/14699-
dc.description.abstractThe topology of a delay tolerant network (DTN) over time has been modeled by a space-time graph. However, the mobility of nodes, such as buses, may not be completely predictable due to factors such as traffic load, road condition, the number of passengers getting on and off the buses, and the operations of traffic lights. In this paper, we adapt the space-time graph by augmenting each horizontal edge with a direct contact probability to model the uncertainty of connectivity. With such an augmented space-time graph, our goal is to compute a shortest routing path satisfying a given end-to-end delivery reliability in a DTN. To facilitate such computation, we adapt the Floyd-Warshall algorithm to compute the maximum contact probability matrix at each time interval. By using an iterative matrix multiplication scheme on a maximum contact matrix, we can compute the shortest path satisfying the reliability constraint. Simulation results validate the performance of our solution which achieves a good balance between delay and reliability.en_US
dc.language.isoen_USen_US
dc.subjectdelay tolerant networken_US
dc.subjectreliable routingen_US
dc.subjectspace-time graphen_US
dc.titleShortest Path Routing with Reliability Requirement in Delay Tolerant Networksen_US
dc.typeArticleen_US
dc.identifier.journal2009 FIRST INTERNATIONAL CONFERENCE ON FUTURE INFORMATION NETWORKSen_US
dc.citation.spage292en_US
dc.citation.epage297en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000291324500056-
顯示於類別:會議論文