ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Jeong, Jaeseong [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
13 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls - Poo, J.L. ELSEVIER, 2016, the international journal of computer and telecommunications networking, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:59 ; year:2014 ; day:11 ; month:02 ; pages:184-196 ; extent:13 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.bjp.2013.11.006 |
|---|
| Katalog-ID: |
ELV039171868 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV039171868 | ||
| 003 | DE-627 | ||
| 005 | 20230625224219.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2014 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.bjp.2013.11.006 |2 doi | |
| 028 | 5 | 2 | |a GBVA2014003000008.pica |
| 035 | |a (DE-627)ELV039171868 | ||
| 035 | |a (ELSEVIER)S1389-1286(13)00378-2 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 |a 620 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 620 |q DE-600 |
| 082 | 0 | 4 | |a 610 |q VZ |
| 082 | 0 | 4 | |a 610 |q VZ |
| 084 | |a 44.44 |2 bkl | ||
| 100 | 1 | |a Jeong, Jaeseong |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| 264 | 1 | |c 2014transfer abstract | |
| 300 | |a 13 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. | ||
| 520 | |a Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. | ||
| 650 | 7 | |a Opportunistic forwarding |2 Elsevier | |
| 650 | 7 | |a Routing |2 Elsevier | |
| 650 | 7 | |a Delay Tolerant Networks |2 Elsevier | |
| 700 | 1 | |a Lee, Kyunghan |4 oth | |
| 700 | 1 | |a Yi, Yung |4 oth | |
| 700 | 1 | |a Rhee, Injong |4 oth | |
| 700 | 1 | |a Chong, Song |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Poo, J.L. ELSEVIER |t Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |d 2016 |d the international journal of computer and telecommunications networking |g Amsterdam [u.a.] |w (DE-627)ELV013796984 |
| 773 | 1 | 8 | |g volume:59 |g year:2014 |g day:11 |g month:02 |g pages:184-196 |g extent:13 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.bjp.2013.11.006 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 44.44 |j Parasitologie |x Medizin |q VZ |
| 951 | |a AR | ||
| 952 | |d 59 |j 2014 |b 11 |c 0211 |h 184-196 |g 13 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
j j jj |
|---|---|
| matchkey_str |
jeongjaeseongleekyunghanyiyungrheeinjong:2014----:xiaotnmtifroeopruiyannea |
| hierarchy_sort_str |
2014transfer abstract |
| bklnumber |
44.44 |
| publishDate |
2014 |
| allfields |
10.1016/j.bjp.2013.11.006 doi GBVA2014003000008.pica (DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 DE-627 ger DE-627 rakwb eng 004 620 004 DE-600 620 DE-600 610 VZ 610 VZ 44.44 bkl Jeong, Jaeseong verfasserin aut ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks 2014transfer abstract 13 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier Lee, Kyunghan oth Yi, Yung oth Rhee, Injong oth Chong, Song oth Enthalten in Elsevier Poo, J.L. ELSEVIER Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls 2016 the international journal of computer and telecommunications networking Amsterdam [u.a.] (DE-627)ELV013796984 volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 https://doi.org/10.1016/j.bjp.2013.11.006 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.44 Parasitologie Medizin VZ AR 59 2014 11 0211 184-196 13 045F 004 |
| spelling |
10.1016/j.bjp.2013.11.006 doi GBVA2014003000008.pica (DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 DE-627 ger DE-627 rakwb eng 004 620 004 DE-600 620 DE-600 610 VZ 610 VZ 44.44 bkl Jeong, Jaeseong verfasserin aut ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks 2014transfer abstract 13 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier Lee, Kyunghan oth Yi, Yung oth Rhee, Injong oth Chong, Song oth Enthalten in Elsevier Poo, J.L. ELSEVIER Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls 2016 the international journal of computer and telecommunications networking Amsterdam [u.a.] (DE-627)ELV013796984 volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 https://doi.org/10.1016/j.bjp.2013.11.006 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.44 Parasitologie Medizin VZ AR 59 2014 11 0211 184-196 13 045F 004 |
| allfields_unstemmed |
10.1016/j.bjp.2013.11.006 doi GBVA2014003000008.pica (DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 DE-627 ger DE-627 rakwb eng 004 620 004 DE-600 620 DE-600 610 VZ 610 VZ 44.44 bkl Jeong, Jaeseong verfasserin aut ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks 2014transfer abstract 13 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier Lee, Kyunghan oth Yi, Yung oth Rhee, Injong oth Chong, Song oth Enthalten in Elsevier Poo, J.L. ELSEVIER Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls 2016 the international journal of computer and telecommunications networking Amsterdam [u.a.] (DE-627)ELV013796984 volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 https://doi.org/10.1016/j.bjp.2013.11.006 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.44 Parasitologie Medizin VZ AR 59 2014 11 0211 184-196 13 045F 004 |
| allfieldsGer |
10.1016/j.bjp.2013.11.006 doi GBVA2014003000008.pica (DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 DE-627 ger DE-627 rakwb eng 004 620 004 DE-600 620 DE-600 610 VZ 610 VZ 44.44 bkl Jeong, Jaeseong verfasserin aut ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks 2014transfer abstract 13 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier Lee, Kyunghan oth Yi, Yung oth Rhee, Injong oth Chong, Song oth Enthalten in Elsevier Poo, J.L. ELSEVIER Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls 2016 the international journal of computer and telecommunications networking Amsterdam [u.a.] (DE-627)ELV013796984 volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 https://doi.org/10.1016/j.bjp.2013.11.006 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.44 Parasitologie Medizin VZ AR 59 2014 11 0211 184-196 13 045F 004 |
| allfieldsSound |
10.1016/j.bjp.2013.11.006 doi GBVA2014003000008.pica (DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 DE-627 ger DE-627 rakwb eng 004 620 004 DE-600 620 DE-600 610 VZ 610 VZ 44.44 bkl Jeong, Jaeseong verfasserin aut ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks 2014transfer abstract 13 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier Lee, Kyunghan oth Yi, Yung oth Rhee, Injong oth Chong, Song oth Enthalten in Elsevier Poo, J.L. ELSEVIER Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls 2016 the international journal of computer and telecommunications networking Amsterdam [u.a.] (DE-627)ELV013796984 volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 https://doi.org/10.1016/j.bjp.2013.11.006 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 44.44 Parasitologie Medizin VZ AR 59 2014 11 0211 184-196 13 045F 004 |
| language |
English |
| source |
Enthalten in Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls Amsterdam [u.a.] volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 |
| sourceStr |
Enthalten in Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls Amsterdam [u.a.] volume:59 year:2014 day:11 month:02 pages:184-196 extent:13 |
| format_phy_str_mv |
Article |
| bklname |
Parasitologie |
| institution |
findex.gbv.de |
| topic_facet |
Opportunistic forwarding Routing Delay Tolerant Networks |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |
| authorswithroles_txt_mv |
Jeong, Jaeseong @@aut@@ Lee, Kyunghan @@oth@@ Yi, Yung @@oth@@ Rhee, Injong @@oth@@ Chong, Song @@oth@@ |
| publishDateDaySort_date |
2014-01-11T00:00:00Z |
| hierarchy_top_id |
ELV013796984 |
| dewey-sort |
14 |
| id |
ELV039171868 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039171868</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625224219.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.bjp.2013.11.006</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014003000008.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039171868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1389-1286(13)00378-2</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="a">620</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.44</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jeong, Jaeseong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Opportunistic forwarding</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Routing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delay Tolerant Networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lee, Kyunghan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yi, Yung</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rhee, Injong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chong, Song</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Poo, J.L. ELSEVIER</subfield><subfield code="t">Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls</subfield><subfield code="d">2016</subfield><subfield code="d">the international journal of computer and telecommunications networking</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013796984</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2014</subfield><subfield code="g">day:11</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:184-196</subfield><subfield code="g">extent:13</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.bjp.2013.11.006</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.44</subfield><subfield code="j">Parasitologie</subfield><subfield code="x">Medizin</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2014</subfield><subfield code="b">11</subfield><subfield code="c">0211</subfield><subfield code="h">184-196</subfield><subfield code="g">13</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Jeong, Jaeseong |
| spellingShingle |
Jeong, Jaeseong ddc 004 ddc 620 ddc 610 bkl 44.44 Elsevier Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| authorStr |
Jeong, Jaeseong |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013796984 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 620 004 DE-600 620 DE-600 610 VZ 44.44 bkl ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks Elsevier |
| topic |
ddc 004 ddc 620 ddc 610 bkl 44.44 Elsevier Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks |
| topic_unstemmed |
ddc 004 ddc 620 ddc 610 bkl 44.44 Elsevier Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks |
| topic_browse |
ddc 004 ddc 620 ddc 610 bkl 44.44 Elsevier Opportunistic forwarding Elsevier Routing Elsevier Delay Tolerant Networks |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
k l kl y y yy i r ir s c sc |
| hierarchy_parent_title |
Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |
| hierarchy_parent_id |
ELV013796984 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering 610 - Medicine & health |
| hierarchy_top_title |
Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013796984 |
| title |
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| ctrlnum |
(DE-627)ELV039171868 (ELSEVIER)S1389-1286(13)00378-2 |
| title_full |
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| author_sort |
Jeong, Jaeseong |
| journal |
Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |
| journalStr |
Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
zzz |
| container_start_page |
184 |
| author_browse |
Jeong, Jaeseong |
| container_volume |
59 |
| physical |
13 |
| class |
004 620 004 DE-600 620 DE-600 610 VZ 44.44 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Jeong, Jaeseong |
| doi_str_mv |
10.1016/j.bjp.2013.11.006 |
| dewey-full |
004 620 610 |
| title_sort |
exmin: a routing metric for novel opportunity gain in delay tolerant networks |
| title_auth |
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| abstract |
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. |
| abstractGer |
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. |
| abstract_unstemmed |
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA GBV_ILN_40 |
| title_short |
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks |
| url |
https://doi.org/10.1016/j.bjp.2013.11.006 |
| remote_bool |
true |
| author2 |
Lee, Kyunghan Yi, Yung Rhee, Injong Chong, Song |
| author2Str |
Lee, Kyunghan Yi, Yung Rhee, Injong Chong, Song |
| ppnlink |
ELV013796984 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1016/j.bjp.2013.11.006 |
| up_date |
2024-07-06T19:57:30.077Z |
| _version_ |
1803860941290340352 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV039171868</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625224219.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.bjp.2013.11.006</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2014003000008.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039171868</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1389-1286(13)00378-2</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="a">620</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.44</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jeong, Jaeseong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes’ probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes’ intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Opportunistic forwarding</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Routing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delay Tolerant Networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lee, Kyunghan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yi, Yung</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rhee, Injong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chong, Song</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Poo, J.L. ELSEVIER</subfield><subfield code="t">Pharmacokinetics of the Antifibrotic Drug Pirfenidone in Child Pugh A and B Cirrhotic Patients Compared to Healthy Age-Matched Controls</subfield><subfield code="d">2016</subfield><subfield code="d">the international journal of computer and telecommunications networking</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013796984</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:59</subfield><subfield code="g">year:2014</subfield><subfield code="g">day:11</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:184-196</subfield><subfield code="g">extent:13</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.bjp.2013.11.006</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.44</subfield><subfield code="j">Parasitologie</subfield><subfield code="x">Medizin</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">59</subfield><subfield code="j">2014</subfield><subfield code="b">11</subfield><subfield code="c">0211</subfield><subfield code="h">184-196</subfield><subfield code="g">13</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.4001703 |