Complexity of Routing in Store-and-Forward LEO Satellite Networks
In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path sched...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sun, Fuchun [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: IEEE communications letters - New York, NY : IEEE, 1997, 20(2016), 1, Seite 89-92 |
|---|---|
| Übergeordnetes Werk: |
volume:20 ; year:2016 ; number:1 ; pages:89-92 |
| Links: |
|---|
| DOI / URN: |
10.1109/LCOMM.2015.2501399 |
|---|
| Katalog-ID: |
OLC1971351210 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1971351210 | ||
| 003 | DE-627 | ||
| 005 | 20230714181609.0 | ||
| 007 | tu | ||
| 008 | 160212s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1109/LCOMM.2015.2501399 |2 doi | |
| 028 | 5 | 2 | |a PQ20160212 |
| 035 | |a (DE-627)OLC1971351210 | ||
| 035 | |a (DE-599)GBVOLC1971351210 | ||
| 035 | |a (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 | ||
| 035 | |a (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |a 004 |q DNB |
| 100 | 1 | |a Sun, Fuchun |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. | ||
| 650 | 4 | |a Schedules | |
| 650 | 4 | |a complexity | |
| 650 | 4 | |a LEO Satellite Network (LSN) | |
| 650 | 4 | |a Routing | |
| 650 | 4 | |a Complexity theory | |
| 650 | 4 | |a Satellites | |
| 650 | 4 | |a Orbits | |
| 650 | 4 | |a Handover | |
| 700 | 1 | |a Qin, Donghong |4 oth | |
| 700 | 1 | |a Zhao, Youjian |4 oth | |
| 700 | 1 | |a Lu, Yong |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE communications letters |d New York, NY : IEEE, 1997 |g 20(2016), 1, Seite 89-92 |w (DE-627)224842838 |w (DE-600)1360382-6 |w (DE-576)058070435 |x 1089-7798 |7 nnns |
| 773 | 1 | 8 | |g volume:20 |g year:2016 |g number:1 |g pages:89-92 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1109/LCOMM.2015.2501399 |3 Volltext |
| 856 | 4 | 2 | |u http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 20 |j 2016 |e 1 |h 89-92 | ||
| author_variant |
f s fs |
|---|---|
| matchkey_str |
article:10897798:2016----::opeiyfotnisoenfradest |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
10.1109/LCOMM.2015.2501399 doi PQ20160212 (DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene DE-627 ger DE-627 rakwb eng 620 004 DNB Sun, Fuchun verfasserin aut Complexity of Routing in Store-and-Forward LEO Satellite Networks 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover Qin, Donghong oth Zhao, Youjian oth Lu, Yong oth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 1, Seite 89-92 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:1 pages:89-92 http://dx.doi.org/10.1109/LCOMM.2015.2501399 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 1 89-92 |
| spelling |
10.1109/LCOMM.2015.2501399 doi PQ20160212 (DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene DE-627 ger DE-627 rakwb eng 620 004 DNB Sun, Fuchun verfasserin aut Complexity of Routing in Store-and-Forward LEO Satellite Networks 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover Qin, Donghong oth Zhao, Youjian oth Lu, Yong oth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 1, Seite 89-92 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:1 pages:89-92 http://dx.doi.org/10.1109/LCOMM.2015.2501399 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 1 89-92 |
| allfields_unstemmed |
10.1109/LCOMM.2015.2501399 doi PQ20160212 (DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene DE-627 ger DE-627 rakwb eng 620 004 DNB Sun, Fuchun verfasserin aut Complexity of Routing in Store-and-Forward LEO Satellite Networks 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover Qin, Donghong oth Zhao, Youjian oth Lu, Yong oth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 1, Seite 89-92 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:1 pages:89-92 http://dx.doi.org/10.1109/LCOMM.2015.2501399 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 1 89-92 |
| allfieldsGer |
10.1109/LCOMM.2015.2501399 doi PQ20160212 (DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene DE-627 ger DE-627 rakwb eng 620 004 DNB Sun, Fuchun verfasserin aut Complexity of Routing in Store-and-Forward LEO Satellite Networks 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover Qin, Donghong oth Zhao, Youjian oth Lu, Yong oth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 1, Seite 89-92 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:1 pages:89-92 http://dx.doi.org/10.1109/LCOMM.2015.2501399 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 1 89-92 |
| allfieldsSound |
10.1109/LCOMM.2015.2501399 doi PQ20160212 (DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene DE-627 ger DE-627 rakwb eng 620 004 DNB Sun, Fuchun verfasserin aut Complexity of Routing in Store-and-Forward LEO Satellite Networks 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover Qin, Donghong oth Zhao, Youjian oth Lu, Yong oth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 1, Seite 89-92 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:1 pages:89-92 http://dx.doi.org/10.1109/LCOMM.2015.2501399 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 1 89-92 |
| language |
English |
| source |
Enthalten in IEEE communications letters 20(2016), 1, Seite 89-92 volume:20 year:2016 number:1 pages:89-92 |
| sourceStr |
Enthalten in IEEE communications letters 20(2016), 1, Seite 89-92 volume:20 year:2016 number:1 pages:89-92 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
IEEE communications letters |
| authorswithroles_txt_mv |
Sun, Fuchun @@aut@@ Qin, Donghong @@oth@@ Zhao, Youjian @@oth@@ Lu, Yong @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
224842838 |
| dewey-sort |
3620 |
| id |
OLC1971351210 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1971351210</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714181609.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160212s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/LCOMM.2015.2501399</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1971351210</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1971351210</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene</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">620</subfield><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sun, Fuchun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of Routing in Store-and-Forward LEO Satellite Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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="520" ind1=" " ind2=" "><subfield code="a">In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Schedules</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LEO Satellite Network (LSN)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Satellites</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orbits</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Handover</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qin, Donghong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Youjian</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lu, Yong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE communications letters</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">20(2016), 1, Seite 89-92</subfield><subfield code="w">(DE-627)224842838</subfield><subfield code="w">(DE-600)1360382-6</subfield><subfield code="w">(DE-576)058070435</subfield><subfield code="x">1089-7798</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:89-92</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/LCOMM.2015.2501399</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258</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-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">20</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">89-92</subfield></datafield></record></collection>
|
| author |
Sun, Fuchun |
| spellingShingle |
Sun, Fuchun ddc 620 misc Schedules misc complexity misc LEO Satellite Network (LSN) misc Routing misc Complexity theory misc Satellites misc Orbits misc Handover Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| authorStr |
Sun, Fuchun |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)224842838 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1089-7798 |
| topic_title |
620 004 DNB Complexity of Routing in Store-and-Forward LEO Satellite Networks Schedules complexity LEO Satellite Network (LSN) Routing Complexity theory Satellites Orbits Handover |
| topic |
ddc 620 misc Schedules misc complexity misc LEO Satellite Network (LSN) misc Routing misc Complexity theory misc Satellites misc Orbits misc Handover |
| topic_unstemmed |
ddc 620 misc Schedules misc complexity misc LEO Satellite Network (LSN) misc Routing misc Complexity theory misc Satellites misc Orbits misc Handover |
| topic_browse |
ddc 620 misc Schedules misc complexity misc LEO Satellite Network (LSN) misc Routing misc Complexity theory misc Satellites misc Orbits misc Handover |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
d q dq y z yz y l yl |
| hierarchy_parent_title |
IEEE communications letters |
| hierarchy_parent_id |
224842838 |
| dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
IEEE communications letters |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 |
| title |
Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| ctrlnum |
(DE-627)OLC1971351210 (DE-599)GBVOLC1971351210 (PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300 (KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene |
| title_full |
Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| author_sort |
Sun, Fuchun |
| journal |
IEEE communications letters |
| journalStr |
IEEE communications letters |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
89 |
| author_browse |
Sun, Fuchun |
| container_volume |
20 |
| class |
620 004 DNB |
| format_se |
Aufsätze |
| author-letter |
Sun, Fuchun |
| doi_str_mv |
10.1109/LCOMM.2015.2501399 |
| dewey-full |
620 004 |
| title_sort |
complexity of routing in store-and-forward leo satellite networks |
| title_auth |
Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| abstract |
In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. |
| abstractGer |
In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. |
| abstract_unstemmed |
In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
1 |
| title_short |
Complexity of Routing in Store-and-Forward LEO Satellite Networks |
| url |
http://dx.doi.org/10.1109/LCOMM.2015.2501399 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258 |
| remote_bool |
false |
| author2 |
Qin, Donghong Zhao, Youjian Lu, Yong |
| author2Str |
Qin, Donghong Zhao, Youjian Lu, Yong |
| ppnlink |
224842838 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1109/LCOMM.2015.2501399 |
| up_date |
2024-07-03T19:09:58.063Z |
| _version_ |
1803586159838756865 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1971351210</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714181609.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160212s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/LCOMM.2015.2501399</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1971351210</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1971351210</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c72c-e7999bc59868a97744777e122e14b1443d5c7122e2113759e2347b5a33369f300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326031320160000020000100089complexityofroutinginstoreandforwardleosatellitene</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">620</subfield><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sun, Fuchun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of Routing in Store-and-Forward LEO Satellite Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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="520" ind1=" " ind2=" "><subfield code="a">In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Schedules</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LEO Satellite Network (LSN)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Satellites</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orbits</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Handover</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qin, Donghong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Youjian</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lu, Yong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE communications letters</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">20(2016), 1, Seite 89-92</subfield><subfield code="w">(DE-627)224842838</subfield><subfield code="w">(DE-600)1360382-6</subfield><subfield code="w">(DE-576)058070435</subfield><subfield code="x">1089-7798</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:89-92</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/LCOMM.2015.2501399</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7331258</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-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">20</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">89-92</subfield></datafield></record></collection>
|
| score |
7.4010687 |