Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas
Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Tran, Tien [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2017 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of combinatorial optimization - Springer US, 1997, 34(2017), 4 vom: 21. März, Seite 1029-1051 |
|---|---|
| Übergeordnetes Werk: |
volume:34 ; year:2017 ; number:4 ; day:21 ; month:03 ; pages:1029-1051 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10878-017-0126-0 |
|---|
| Katalog-ID: |
OLC2044622904 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2044622904 | ||
| 003 | DE-627 | ||
| 005 | 20230503135038.0 | ||
| 007 | tu | ||
| 008 | 200819s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10878-017-0126-0 |2 doi | |
| 035 | |a (DE-627)OLC2044622904 | ||
| 035 | |a (DE-He213)s10878-017-0126-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Tran, Tien |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| 264 | 1 | |c 2017 | |
| 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 New York 2017 | ||
| 520 | |a Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. | ||
| 650 | 4 | |a Wireless sensor network | |
| 650 | 4 | |a Directional antenna | |
| 650 | 4 | |a Symmetric connectivity | |
| 650 | 4 | |a Algorithm | |
| 650 | 4 | |a Complexity | |
| 700 | 1 | |a An, Min Kyung |4 aut | |
| 700 | 1 | |a Huynh, Dung T. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of combinatorial optimization |d Springer US, 1997 |g 34(2017), 4 vom: 21. März, Seite 1029-1051 |w (DE-627)216539323 |w (DE-600)1339574-9 |w (DE-576)094421935 |x 1382-6905 |7 nnns |
| 773 | 1 | 8 | |g volume:34 |g year:2017 |g number:4 |g day:21 |g month:03 |g pages:1029-1051 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10878-017-0126-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2108 | ||
| 951 | |a AR | ||
| 952 | |d 34 |j 2017 |e 4 |b 21 |c 03 |h 1029-1051 | ||
| author_variant |
t t tt m k a mk mka d t h dt dth |
|---|---|
| matchkey_str |
article:13826905:2017----::salsigymticnetvtidrcinlieesesrewrs |
| hierarchy_sort_str |
2017 |
| publishDate |
2017 |
| allfields |
10.1007/s10878-017-0126-0 doi (DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Tran, Tien verfasserin aut Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2017 Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity An, Min Kyung aut Huynh, Dung T. aut Enthalten in Journal of combinatorial optimization Springer US, 1997 34(2017), 4 vom: 21. März, Seite 1029-1051 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 https://doi.org/10.1007/s10878-017-0126-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 AR 34 2017 4 21 03 1029-1051 |
| spelling |
10.1007/s10878-017-0126-0 doi (DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Tran, Tien verfasserin aut Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2017 Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity An, Min Kyung aut Huynh, Dung T. aut Enthalten in Journal of combinatorial optimization Springer US, 1997 34(2017), 4 vom: 21. März, Seite 1029-1051 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 https://doi.org/10.1007/s10878-017-0126-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 AR 34 2017 4 21 03 1029-1051 |
| allfields_unstemmed |
10.1007/s10878-017-0126-0 doi (DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Tran, Tien verfasserin aut Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2017 Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity An, Min Kyung aut Huynh, Dung T. aut Enthalten in Journal of combinatorial optimization Springer US, 1997 34(2017), 4 vom: 21. März, Seite 1029-1051 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 https://doi.org/10.1007/s10878-017-0126-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 AR 34 2017 4 21 03 1029-1051 |
| allfieldsGer |
10.1007/s10878-017-0126-0 doi (DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Tran, Tien verfasserin aut Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2017 Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity An, Min Kyung aut Huynh, Dung T. aut Enthalten in Journal of combinatorial optimization Springer US, 1997 34(2017), 4 vom: 21. März, Seite 1029-1051 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 https://doi.org/10.1007/s10878-017-0126-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 AR 34 2017 4 21 03 1029-1051 |
| allfieldsSound |
10.1007/s10878-017-0126-0 doi (DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Tran, Tien verfasserin aut Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2017 Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity An, Min Kyung aut Huynh, Dung T. aut Enthalten in Journal of combinatorial optimization Springer US, 1997 34(2017), 4 vom: 21. März, Seite 1029-1051 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 https://doi.org/10.1007/s10878-017-0126-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 AR 34 2017 4 21 03 1029-1051 |
| language |
English |
| source |
Enthalten in Journal of combinatorial optimization 34(2017), 4 vom: 21. März, Seite 1029-1051 volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 |
| sourceStr |
Enthalten in Journal of combinatorial optimization 34(2017), 4 vom: 21. März, Seite 1029-1051 volume:34 year:2017 number:4 day:21 month:03 pages:1029-1051 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of combinatorial optimization |
| authorswithroles_txt_mv |
Tran, Tien @@aut@@ An, Min Kyung @@aut@@ Huynh, Dung T. @@aut@@ |
| publishDateDaySort_date |
2017-03-21T00:00:00Z |
| hierarchy_top_id |
216539323 |
| dewey-sort |
3510 |
| id |
OLC2044622904 |
| 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">OLC2044622904</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503135038.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-017-0126-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044622904</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-017-0126-0-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tran, Tien</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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 New York 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless sensor network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directional antenna</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symmetric connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">An, Min Kyung</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huynh, Dung T.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">34(2017), 4 vom: 21. März, Seite 1029-1051</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">day:21</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1029-1051</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-017-0126-0</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="b">21</subfield><subfield code="c">03</subfield><subfield code="h">1029-1051</subfield></datafield></record></collection>
|
| author |
Tran, Tien |
| spellingShingle |
Tran, Tien ddc 510 ssgn 3,2 misc Wireless sensor network misc Directional antenna misc Symmetric connectivity misc Algorithm misc Complexity Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| authorStr |
Tran, Tien |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)216539323 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1382-6905 |
| topic_title |
510 VZ 3,2 ssgn Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas Wireless sensor network Directional antenna Symmetric connectivity Algorithm Complexity |
| topic |
ddc 510 ssgn 3,2 misc Wireless sensor network misc Directional antenna misc Symmetric connectivity misc Algorithm misc Complexity |
| topic_unstemmed |
ddc 510 ssgn 3,2 misc Wireless sensor network misc Directional antenna misc Symmetric connectivity misc Algorithm misc Complexity |
| topic_browse |
ddc 510 ssgn 3,2 misc Wireless sensor network misc Directional antenna misc Symmetric connectivity misc Algorithm misc Complexity |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of combinatorial optimization |
| hierarchy_parent_id |
216539323 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of combinatorial optimization |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 |
| title |
Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| ctrlnum |
(DE-627)OLC2044622904 (DE-He213)s10878-017-0126-0-p |
| title_full |
Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| author_sort |
Tran, Tien |
| journal |
Journal of combinatorial optimization |
| journalStr |
Journal of combinatorial optimization |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
1029 |
| author_browse |
Tran, Tien An, Min Kyung Huynh, Dung T. |
| container_volume |
34 |
| class |
510 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Tran, Tien |
| doi_str_mv |
10.1007/s10878-017-0126-0 |
| dewey-full |
510 |
| title_sort |
establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| title_auth |
Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| abstract |
Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. © Springer Science+Business Media New York 2017 |
| abstractGer |
Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. © Springer Science+Business Media New York 2017 |
| abstract_unstemmed |
Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations. © Springer Science+Business Media New York 2017 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_2108 |
| container_issue |
4 |
| title_short |
Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas |
| url |
https://doi.org/10.1007/s10878-017-0126-0 |
| remote_bool |
false |
| author2 |
An, Min Kyung Huynh, Dung T. |
| author2Str |
An, Min Kyung Huynh, Dung T. |
| ppnlink |
216539323 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10878-017-0126-0 |
| up_date |
2024-07-04T00:11:37.878Z |
| _version_ |
1803605138870370304 |
| 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">OLC2044622904</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503135038.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-017-0126-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044622904</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-017-0126-0-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tran, Tien</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$ antennas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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 New York 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width $$\theta = 2\pi /3$$ and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an orientation of the antennas and to find a minimum transmission power range $$r=O(1)$$ such that the induced symmetric communication graph is connected. We propose two algorithms that orient the antennas to yield symmetric connected communication graphs where the transmission power ranges are bounded by 6 and 5, which are currently the best results for this problem. We also study the performance of our algorithms through simulations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wireless sensor network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directional antenna</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symmetric connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">An, Min Kyung</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huynh, Dung T.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">34(2017), 4 vom: 21. März, Seite 1029-1051</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">day:21</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1029-1051</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-017-0126-0</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="b">21</subfield><subfield code="c">03</subfield><subfield code="h">1029-1051</subfield></datafield></record></collection>
|
| score |
7.4010878 |