Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products
Network reliability evaluation of Delay Tolerant Networks (DTNs) is a challenging task due to their inherent features like node mobility, dynamically changing network topology and existence of highly disruptive environmental conditions etc. The research so far on such time-evolving dynamic networks...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/20.500.11937/60054 |
| _version_ | 1848760576699793408 |
|---|---|
| author | Chaturvedi, S. Khanna, G. Soh, Sie Teng |
| author_facet | Chaturvedi, S. Khanna, G. Soh, Sie Teng |
| author_sort | Chaturvedi, S. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Network reliability evaluation of Delay Tolerant Networks (DTNs) is a challenging task due to their inherent features like node mobility, dynamically changing network topology and existence of highly disruptive environmental conditions etc. The research so far on such time-evolving dynamic networks mainly focusses on topology control, routing and information propagation with a little attention paid towards computing their overall network reliability. In this paper, we model DTNs by using Time Aggregated Graph and propose the notion of time-stamped-minimal path sets between a given source-destination pair of nodes, besides, providing a simple yet novel method to enumerate them. Further, by employing Multiple Variable Inversion-Sum of Disjoint Products algorithm, we obtain disjointed time-stamped-minimal path sets, which have a one-to-one mapping with the overall reliability expression of such time evolving networks. For obtaining instances of a DTN during an operational period, we resort to Monte Carlo Simulation to simulate the dynamically changing topology and other probabilistically varying network aspects. The simulation results demonstrate the efficacy of our proposal. At the end, we also present some initial investigation and insight on the time-stamped-minimal cut sets and problem in enumerating them, and infer that the usual notion of cut sets seems inapplicable for dynamic networks. |
| first_indexed | 2025-11-14T10:17:59Z |
| format | Journal Article |
| id | curtin-20.500.11937-60054 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:17:59Z |
| publishDate | 2018 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-600542018-07-09T00:41:23Z Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products Chaturvedi, S. Khanna, G. Soh, Sie Teng Network reliability evaluation of Delay Tolerant Networks (DTNs) is a challenging task due to their inherent features like node mobility, dynamically changing network topology and existence of highly disruptive environmental conditions etc. The research so far on such time-evolving dynamic networks mainly focusses on topology control, routing and information propagation with a little attention paid towards computing their overall network reliability. In this paper, we model DTNs by using Time Aggregated Graph and propose the notion of time-stamped-minimal path sets between a given source-destination pair of nodes, besides, providing a simple yet novel method to enumerate them. Further, by employing Multiple Variable Inversion-Sum of Disjoint Products algorithm, we obtain disjointed time-stamped-minimal path sets, which have a one-to-one mapping with the overall reliability expression of such time evolving networks. For obtaining instances of a DTN during an operational period, we resort to Monte Carlo Simulation to simulate the dynamically changing topology and other probabilistically varying network aspects. The simulation results demonstrate the efficacy of our proposal. At the end, we also present some initial investigation and insight on the time-stamped-minimal cut sets and problem in enumerating them, and infer that the usual notion of cut sets seems inapplicable for dynamic networks. 2018 Journal Article http://hdl.handle.net/20.500.11937/60054 10.1016/j.ress.2017.11.007 restricted |
| spellingShingle | Chaturvedi, S. Khanna, G. Soh, Sie Teng Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title | Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title_full | Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title_fullStr | Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title_full_unstemmed | Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title_short | Reliability evaluation of time evolving Delay Tolerant Networks based on Sum-of-Disjoint products |
| title_sort | reliability evaluation of time evolving delay tolerant networks based on sum-of-disjoint products |
| url | http://hdl.handle.net/20.500.11937/60054 |