DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks
Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Dezfouli, Behnam [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
18 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Sialorphin and its analog as ligands for copper(II) ions - Kamysz, Elżbieta ELSEVIER, 2013transfer abstract, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2015 ; pages:54-71 ; extent:18 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.adhoc.2014.09.011 |
|---|
| Katalog-ID: |
ELV039680339 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV039680339 | ||
| 003 | DE-627 | ||
| 005 | 20230625225619.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.adhoc.2014.09.011 |2 doi | |
| 028 | 5 | 2 | |a GBVA2015007000009.pica |
| 035 | |a (DE-627)ELV039680339 | ||
| 035 | |a (ELSEVIER)S1570-8705(14)00200-5 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 540 |q VZ |
| 082 | 0 | 4 | |a 300 |a 610 |q VZ |
| 084 | |a 44.06 |2 bkl | ||
| 100 | 1 | |a Dezfouli, Behnam |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| 264 | 1 | |c 2015transfer abstract | |
| 300 | |a 18 | ||
| 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 Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. | ||
| 520 | |a Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. | ||
| 650 | 7 | |a Interference |2 Elsevier | |
| 650 | 7 | |a Scheduling algorithm |2 Elsevier | |
| 650 | 7 | |a MAC |2 Elsevier | |
| 700 | 1 | |a Radi, Marjan |4 oth | |
| 700 | 1 | |a Whitehouse, Kamin |4 oth | |
| 700 | 1 | |a Abd Razak, Shukor |4 oth | |
| 700 | 1 | |a Hwee-Pink, Tan |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier Science |a Kamysz, Elżbieta ELSEVIER |t Sialorphin and its analog as ligands for copper(II) ions |d 2013transfer abstract |g Amsterdam [u.a.] |w (DE-627)ELV016769562 |
| 773 | 1 | 8 | |g volume:25 |g year:2015 |g pages:54-71 |g extent:18 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.adhoc.2014.09.011 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 936 | b | k | |a 44.06 |j Medizinsoziologie |q VZ |
| 951 | |a AR | ||
| 952 | |d 25 |j 2015 |h 54-71 |g 18 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
b d bd |
|---|---|
| matchkey_str |
dezfoulibehnamradimarjanwhitehousekamina:2015----:isdsrbtdncnurnlnshdlnagrtmodtgteig |
| hierarchy_sort_str |
2015transfer abstract |
| bklnumber |
44.06 |
| publishDate |
2015 |
| allfields |
10.1016/j.adhoc.2014.09.011 doi GBVA2015007000009.pica (DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 DE-627 ger DE-627 rakwb eng 004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl Dezfouli, Behnam verfasserin aut DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier Radi, Marjan oth Whitehouse, Kamin oth Abd Razak, Shukor oth Hwee-Pink, Tan oth Enthalten in Elsevier Science Kamysz, Elżbieta ELSEVIER Sialorphin and its analog as ligands for copper(II) ions 2013transfer abstract Amsterdam [u.a.] (DE-627)ELV016769562 volume:25 year:2015 pages:54-71 extent:18 https://doi.org/10.1016/j.adhoc.2014.09.011 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.06 Medizinsoziologie VZ AR 25 2015 54-71 18 045F 004 |
| spelling |
10.1016/j.adhoc.2014.09.011 doi GBVA2015007000009.pica (DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 DE-627 ger DE-627 rakwb eng 004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl Dezfouli, Behnam verfasserin aut DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier Radi, Marjan oth Whitehouse, Kamin oth Abd Razak, Shukor oth Hwee-Pink, Tan oth Enthalten in Elsevier Science Kamysz, Elżbieta ELSEVIER Sialorphin and its analog as ligands for copper(II) ions 2013transfer abstract Amsterdam [u.a.] (DE-627)ELV016769562 volume:25 year:2015 pages:54-71 extent:18 https://doi.org/10.1016/j.adhoc.2014.09.011 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.06 Medizinsoziologie VZ AR 25 2015 54-71 18 045F 004 |
| allfields_unstemmed |
10.1016/j.adhoc.2014.09.011 doi GBVA2015007000009.pica (DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 DE-627 ger DE-627 rakwb eng 004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl Dezfouli, Behnam verfasserin aut DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier Radi, Marjan oth Whitehouse, Kamin oth Abd Razak, Shukor oth Hwee-Pink, Tan oth Enthalten in Elsevier Science Kamysz, Elżbieta ELSEVIER Sialorphin and its analog as ligands for copper(II) ions 2013transfer abstract Amsterdam [u.a.] (DE-627)ELV016769562 volume:25 year:2015 pages:54-71 extent:18 https://doi.org/10.1016/j.adhoc.2014.09.011 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.06 Medizinsoziologie VZ AR 25 2015 54-71 18 045F 004 |
| allfieldsGer |
10.1016/j.adhoc.2014.09.011 doi GBVA2015007000009.pica (DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 DE-627 ger DE-627 rakwb eng 004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl Dezfouli, Behnam verfasserin aut DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier Radi, Marjan oth Whitehouse, Kamin oth Abd Razak, Shukor oth Hwee-Pink, Tan oth Enthalten in Elsevier Science Kamysz, Elżbieta ELSEVIER Sialorphin and its analog as ligands for copper(II) ions 2013transfer abstract Amsterdam [u.a.] (DE-627)ELV016769562 volume:25 year:2015 pages:54-71 extent:18 https://doi.org/10.1016/j.adhoc.2014.09.011 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.06 Medizinsoziologie VZ AR 25 2015 54-71 18 045F 004 |
| allfieldsSound |
10.1016/j.adhoc.2014.09.011 doi GBVA2015007000009.pica (DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 DE-627 ger DE-627 rakwb eng 004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl Dezfouli, Behnam verfasserin aut DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks 2015transfer abstract 18 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier Radi, Marjan oth Whitehouse, Kamin oth Abd Razak, Shukor oth Hwee-Pink, Tan oth Enthalten in Elsevier Science Kamysz, Elżbieta ELSEVIER Sialorphin and its analog as ligands for copper(II) ions 2013transfer abstract Amsterdam [u.a.] (DE-627)ELV016769562 volume:25 year:2015 pages:54-71 extent:18 https://doi.org/10.1016/j.adhoc.2014.09.011 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.06 Medizinsoziologie VZ AR 25 2015 54-71 18 045F 004 |
| language |
English |
| source |
Enthalten in Sialorphin and its analog as ligands for copper(II) ions Amsterdam [u.a.] volume:25 year:2015 pages:54-71 extent:18 |
| sourceStr |
Enthalten in Sialorphin and its analog as ligands for copper(II) ions Amsterdam [u.a.] volume:25 year:2015 pages:54-71 extent:18 |
| format_phy_str_mv |
Article |
| bklname |
Medizinsoziologie |
| institution |
findex.gbv.de |
| topic_facet |
Interference Scheduling algorithm MAC |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Sialorphin and its analog as ligands for copper(II) ions |
| authorswithroles_txt_mv |
Dezfouli, Behnam @@aut@@ Radi, Marjan @@oth@@ Whitehouse, Kamin @@oth@@ Abd Razak, Shukor @@oth@@ Hwee-Pink, Tan @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
ELV016769562 |
| dewey-sort |
14 |
| id |
ELV039680339 |
| 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">ELV039680339</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625225619.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.adhoc.2014.09.011</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015007000009.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039680339</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1570-8705(14)00200-5</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></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">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">300</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.06</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dezfouli, Behnam</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</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">Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interference</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Scheduling algorithm</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MAC</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Radi, Marjan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Whitehouse, Kamin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Abd Razak, Shukor</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hwee-Pink, Tan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier Science</subfield><subfield code="a">Kamysz, Elżbieta ELSEVIER</subfield><subfield code="t">Sialorphin and its analog as ligands for copper(II) ions</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV016769562</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2015</subfield><subfield code="g">pages:54-71</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.adhoc.2014.09.011</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="936" ind1="b" ind2="k"><subfield code="a">44.06</subfield><subfield code="j">Medizinsoziologie</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">25</subfield><subfield code="j">2015</subfield><subfield code="h">54-71</subfield><subfield code="g">18</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Dezfouli, Behnam |
| spellingShingle |
Dezfouli, Behnam ddc 004 ddc 540 ddc 300 bkl 44.06 Elsevier Interference Elsevier Scheduling algorithm Elsevier MAC DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| authorStr |
Dezfouli, Behnam |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV016769562 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 540 - Chemistry & allied sciences 300 - Social sciences 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks Interference Elsevier Scheduling algorithm Elsevier MAC Elsevier |
| topic |
ddc 004 ddc 540 ddc 300 bkl 44.06 Elsevier Interference Elsevier Scheduling algorithm Elsevier MAC |
| topic_unstemmed |
ddc 004 ddc 540 ddc 300 bkl 44.06 Elsevier Interference Elsevier Scheduling algorithm Elsevier MAC |
| topic_browse |
ddc 004 ddc 540 ddc 300 bkl 44.06 Elsevier Interference Elsevier Scheduling algorithm Elsevier MAC |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
m r mr k w kw r s a rs rsa t h p thp |
| hierarchy_parent_title |
Sialorphin and its analog as ligands for copper(II) ions |
| hierarchy_parent_id |
ELV016769562 |
| dewey-tens |
000 - Computer science, knowledge & systems 540 - Chemistry 300 - Social sciences, sociology & anthropology 610 - Medicine & health |
| hierarchy_top_title |
Sialorphin and its analog as ligands for copper(II) ions |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV016769562 |
| title |
DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| ctrlnum |
(DE-627)ELV039680339 (ELSEVIER)S1570-8705(14)00200-5 |
| title_full |
DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| author_sort |
Dezfouli, Behnam |
| journal |
Sialorphin and its analog as ligands for copper(II) ions |
| journalStr |
Sialorphin and its analog as ligands for copper(II) ions |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science 300 - Social sciences 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
zzz |
| container_start_page |
54 |
| author_browse |
Dezfouli, Behnam |
| container_volume |
25 |
| physical |
18 |
| class |
004 004 DE-600 540 VZ 300 610 VZ 44.06 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Dezfouli, Behnam |
| doi_str_mv |
10.1016/j.adhoc.2014.09.011 |
| dewey-full |
004 540 300 610 |
| title_sort |
dicsa: distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| title_auth |
DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| abstract |
Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. |
| abstractGer |
Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. |
| abstract_unstemmed |
Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA |
| title_short |
DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks |
| url |
https://doi.org/10.1016/j.adhoc.2014.09.011 |
| remote_bool |
true |
| author2 |
Radi, Marjan Whitehouse, Kamin Abd Razak, Shukor Hwee-Pink, Tan |
| author2Str |
Radi, Marjan Whitehouse, Kamin Abd Razak, Shukor Hwee-Pink, Tan |
| ppnlink |
ELV016769562 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1016/j.adhoc.2014.09.011 |
| up_date |
2024-07-06T21:13:46.867Z |
| _version_ |
1803865740403539968 |
| 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">ELV039680339</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625225619.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.adhoc.2014.09.011</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015007000009.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039680339</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1570-8705(14)00200-5</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></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">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">300</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.06</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dezfouli, Behnam</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18</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">Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interference</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Scheduling algorithm</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MAC</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Radi, Marjan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Whitehouse, Kamin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Abd Razak, Shukor</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hwee-Pink, Tan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier Science</subfield><subfield code="a">Kamysz, Elżbieta ELSEVIER</subfield><subfield code="t">Sialorphin and its analog as ligands for copper(II) ions</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV016769562</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2015</subfield><subfield code="g">pages:54-71</subfield><subfield code="g">extent:18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.adhoc.2014.09.011</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="936" ind1="b" ind2="k"><subfield code="a">44.06</subfield><subfield code="j">Medizinsoziologie</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">25</subfield><subfield code="j">2015</subfield><subfield code="h">54-71</subfield><subfield code="g">18</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.4015303 |