A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network
Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work whi...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Chen, Guolong [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The journal of supercomputing - Springer US, 1987, 75(2019), 9 vom: 21. Juni, Seite 5930-5945 |
|---|---|
| Übergeordnetes Werk: |
volume:75 ; year:2019 ; number:9 ; day:21 ; month:06 ; pages:5930-5945 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11227-019-02897-4 |
|---|
| Katalog-ID: |
OLC2033959716 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2033959716 | ||
| 003 | DE-627 | ||
| 005 | 20230504054102.0 | ||
| 007 | tu | ||
| 008 | 200819s2019 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11227-019-02897-4 |2 doi | |
| 035 | |a (DE-627)OLC2033959716 | ||
| 035 | |a (DE-He213)s11227-019-02897-4-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Chen, Guolong |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2019 | ||
| 520 | |a Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. | ||
| 650 | 4 | |a The greedy constructing tree algorithm (GCTA) | |
| 650 | 4 | |a Wireless recharging | |
| 650 | 4 | |a Wireless sensor networks | |
| 650 | 4 | |a The Hamilton graph | |
| 700 | 1 | |a Xin, Zhenghua |4 aut | |
| 700 | 1 | |a Li, Han |4 aut | |
| 700 | 1 | |a Zhu, Tonghai |4 aut | |
| 700 | 1 | |a Wang, Maodi |4 aut | |
| 700 | 1 | |a Liu, Yaxiang |4 aut | |
| 700 | 1 | |a Wei, Sanqiang |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The journal of supercomputing |d Springer US, 1987 |g 75(2019), 9 vom: 21. Juni, Seite 5930-5945 |w (DE-627)13046466X |w (DE-600)740510-8 |w (DE-576)018667775 |x 0920-8542 |7 nnns |
| 773 | 1 | 8 | |g volume:75 |g year:2019 |g number:9 |g day:21 |g month:06 |g pages:5930-5945 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11227-019-02897-4 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 75 |j 2019 |e 9 |b 21 |c 06 |h 5930-5945 | ||
| author_variant |
g c gc z x zx h l hl t z tz m w mw y l yl s w sw |
|---|---|
| matchkey_str |
article:09208542:2019----::gedcntutnteagrtmosotsptipreulieesehr |
| hierarchy_sort_str |
2019 |
| publishDate |
2019 |
| allfields |
10.1007/s11227-019-02897-4 doi (DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p DE-627 ger DE-627 rakwb eng 004 620 VZ Chen, Guolong verfasserin aut A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph Xin, Zhenghua aut Li, Han aut Zhu, Tonghai aut Wang, Maodi aut Liu, Yaxiang aut Wei, Sanqiang aut Enthalten in The journal of supercomputing Springer US, 1987 75(2019), 9 vom: 21. Juni, Seite 5930-5945 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 https://doi.org/10.1007/s11227-019-02897-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 75 2019 9 21 06 5930-5945 |
| spelling |
10.1007/s11227-019-02897-4 doi (DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p DE-627 ger DE-627 rakwb eng 004 620 VZ Chen, Guolong verfasserin aut A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph Xin, Zhenghua aut Li, Han aut Zhu, Tonghai aut Wang, Maodi aut Liu, Yaxiang aut Wei, Sanqiang aut Enthalten in The journal of supercomputing Springer US, 1987 75(2019), 9 vom: 21. Juni, Seite 5930-5945 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 https://doi.org/10.1007/s11227-019-02897-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 75 2019 9 21 06 5930-5945 |
| allfields_unstemmed |
10.1007/s11227-019-02897-4 doi (DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p DE-627 ger DE-627 rakwb eng 004 620 VZ Chen, Guolong verfasserin aut A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph Xin, Zhenghua aut Li, Han aut Zhu, Tonghai aut Wang, Maodi aut Liu, Yaxiang aut Wei, Sanqiang aut Enthalten in The journal of supercomputing Springer US, 1987 75(2019), 9 vom: 21. Juni, Seite 5930-5945 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 https://doi.org/10.1007/s11227-019-02897-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 75 2019 9 21 06 5930-5945 |
| allfieldsGer |
10.1007/s11227-019-02897-4 doi (DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p DE-627 ger DE-627 rakwb eng 004 620 VZ Chen, Guolong verfasserin aut A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph Xin, Zhenghua aut Li, Han aut Zhu, Tonghai aut Wang, Maodi aut Liu, Yaxiang aut Wei, Sanqiang aut Enthalten in The journal of supercomputing Springer US, 1987 75(2019), 9 vom: 21. Juni, Seite 5930-5945 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 https://doi.org/10.1007/s11227-019-02897-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 75 2019 9 21 06 5930-5945 |
| allfieldsSound |
10.1007/s11227-019-02897-4 doi (DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p DE-627 ger DE-627 rakwb eng 004 620 VZ Chen, Guolong verfasserin aut A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph Xin, Zhenghua aut Li, Han aut Zhu, Tonghai aut Wang, Maodi aut Liu, Yaxiang aut Wei, Sanqiang aut Enthalten in The journal of supercomputing Springer US, 1987 75(2019), 9 vom: 21. Juni, Seite 5930-5945 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 https://doi.org/10.1007/s11227-019-02897-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 75 2019 9 21 06 5930-5945 |
| language |
English |
| source |
Enthalten in The journal of supercomputing 75(2019), 9 vom: 21. Juni, Seite 5930-5945 volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 |
| sourceStr |
Enthalten in The journal of supercomputing 75(2019), 9 vom: 21. Juni, Seite 5930-5945 volume:75 year:2019 number:9 day:21 month:06 pages:5930-5945 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The journal of supercomputing |
| authorswithroles_txt_mv |
Chen, Guolong @@aut@@ Xin, Zhenghua @@aut@@ Li, Han @@aut@@ Zhu, Tonghai @@aut@@ Wang, Maodi @@aut@@ Liu, Yaxiang @@aut@@ Wei, Sanqiang @@aut@@ |
| publishDateDaySort_date |
2019-06-21T00:00:00Z |
| hierarchy_top_id |
13046466X |
| dewey-sort |
14 |
| id |
OLC2033959716 |
| 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">OLC2033959716</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504054102.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-019-02897-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033959716</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-019-02897-4-p</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="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Guolong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">The greedy constructing tree algorithm (GCTA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless recharging</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless sensor networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">The Hamilton graph</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xin, Zhenghua</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Han</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Tonghai</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Maodi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Yaxiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wei, Sanqiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">75(2019), 9 vom: 21. Juni, Seite 5930-5945</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:75</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:9</subfield><subfield code="g">day:21</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:5930-5945</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-019-02897-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">75</subfield><subfield code="j">2019</subfield><subfield code="e">9</subfield><subfield code="b">21</subfield><subfield code="c">06</subfield><subfield code="h">5930-5945</subfield></datafield></record></collection>
|
| author |
Chen, Guolong |
| spellingShingle |
Chen, Guolong ddc 004 misc The greedy constructing tree algorithm (GCTA) misc Wireless recharging misc Wireless sensor networks misc The Hamilton graph A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| authorStr |
Chen, Guolong |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13046466X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-8542 |
| topic_title |
004 620 VZ A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network The greedy constructing tree algorithm (GCTA) Wireless recharging Wireless sensor networks The Hamilton graph |
| topic |
ddc 004 misc The greedy constructing tree algorithm (GCTA) misc Wireless recharging misc Wireless sensor networks misc The Hamilton graph |
| topic_unstemmed |
ddc 004 misc The greedy constructing tree algorithm (GCTA) misc Wireless recharging misc Wireless sensor networks misc The Hamilton graph |
| topic_browse |
ddc 004 misc The greedy constructing tree algorithm (GCTA) misc Wireless recharging misc Wireless sensor networks misc The Hamilton graph |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The journal of supercomputing |
| hierarchy_parent_id |
13046466X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
The journal of supercomputing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 |
| title |
A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| ctrlnum |
(DE-627)OLC2033959716 (DE-He213)s11227-019-02897-4-p |
| title_full |
A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| author_sort |
Chen, Guolong |
| journal |
The journal of supercomputing |
| journalStr |
The journal of supercomputing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| container_start_page |
5930 |
| author_browse |
Chen, Guolong Xin, Zhenghua Li, Han Zhu, Tonghai Wang, Maodi Liu, Yaxiang Wei, Sanqiang |
| container_volume |
75 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Chen, Guolong |
| doi_str_mv |
10.1007/s11227-019-02897-4 |
| dewey-full |
004 620 |
| title_sort |
a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| title_auth |
A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| abstract |
Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstractGer |
Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| abstract_unstemmed |
Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely. © Springer Science+Business Media, LLC, part of Springer Nature 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
9 |
| title_short |
A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network |
| url |
https://doi.org/10.1007/s11227-019-02897-4 |
| remote_bool |
false |
| author2 |
Xin, Zhenghua Li, Han Zhu, Tonghai Wang, Maodi Liu, Yaxiang Wei, Sanqiang |
| author2Str |
Xin, Zhenghua Li, Han Zhu, Tonghai Wang, Maodi Liu, Yaxiang Wei, Sanqiang |
| ppnlink |
13046466X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11227-019-02897-4 |
| up_date |
2024-07-03T19:05:11.725Z |
| _version_ |
1803585859592650752 |
| 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">OLC2033959716</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504054102.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-019-02897-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033959716</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-019-02897-4-p</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="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Guolong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">The greedy constructing tree algorithm (GCTA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless recharging</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless sensor networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">The Hamilton graph</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xin, Zhenghua</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Han</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Tonghai</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Maodi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Yaxiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wei, Sanqiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">75(2019), 9 vom: 21. Juni, Seite 5930-5945</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:75</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:9</subfield><subfield code="g">day:21</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:5930-5945</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-019-02897-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">75</subfield><subfield code="j">2019</subfield><subfield code="e">9</subfield><subfield code="b">21</subfield><subfield code="c">06</subfield><subfield code="h">5930-5945</subfield></datafield></record></collection>
|
| score |
7.3990545 |