Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach
This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constan...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Hang [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: IEEE ACM transactions on networking - New York, NY : IEEE, 1993, 24(2016), 3, Seite 1618-1631 |
|---|---|
| Übergeordnetes Werk: |
volume:24 ; year:2016 ; number:3 ; pages:1618-1631 |
| Links: |
|---|
| DOI / URN: |
10.1109/TNET.2015.2421320 |
|---|
| Katalog-ID: |
OLC1978366302 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1978366302 | ||
| 003 | DE-627 | ||
| 005 | 20220219084604.0 | ||
| 007 | tu | ||
| 008 | 160719s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TNET.2015.2421320 |2 doi | |
| 028 | 5 | 2 | |a PQ20160719 |
| 035 | |a (DE-627)OLC1978366302 | ||
| 035 | |a (DE-599)GBVOLC1978366302 | ||
| 035 | |a (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 | ||
| 035 | |a (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |a 004 |q DNB |
| 084 | |a 54.00 |2 bkl | ||
| 084 | |a 05.00 |2 bkl | ||
| 100 | 1 | |a Li, Hang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| 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 This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. | ||
| 650 | 4 | |a optimal stopping | |
| 650 | 4 | |a Batteries | |
| 650 | 4 | |a Transmitters | |
| 650 | 4 | |a Distributed opportunistic scheduling | |
| 650 | 4 | |a Data communication | |
| 650 | 4 | |a Energy harvesting | |
| 650 | 4 | |a Throughput | |
| 650 | 4 | |a Optimal scheduling | |
| 650 | 4 | |a Energy states | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Information Theory | |
| 700 | 1 | |a Huang, Chuan |4 oth | |
| 700 | 1 | |a Zhang, Ping |4 oth | |
| 700 | 1 | |a Cui, Shuguang |4 oth | |
| 700 | 1 | |a Zhang, Junshan |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE ACM transactions on networking |d New York, NY : IEEE, 1993 |g 24(2016), 3, Seite 1618-1631 |w (DE-627)165670215 |w (DE-600)1150634-9 |w (DE-576)034200843 |x 1063-6692 |7 nnns |
| 773 | 1 | 8 | |g volume:24 |g year:2016 |g number:3 |g pages:1618-1631 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1109/TNET.2015.2421320 |3 Volltext |
| 856 | 4 | 2 | |u http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 |
| 856 | 4 | 2 | |u http://arxiv.org/abs/1502.07598 |
| 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 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_4125 | ||
| 936 | b | k | |a 54.00 |q AVZ |
| 936 | b | k | |a 05.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 24 |j 2016 |e 3 |h 1618-1631 | ||
| author_variant |
h l hl |
|---|---|
| matchkey_str |
article:10636692:2016----::itiueopruitcceuigoeeghretnbsdieesewr |
| hierarchy_sort_str |
2016 |
| bklnumber |
54.00 05.00 |
| publishDate |
2016 |
| allfields |
10.1109/TNET.2015.2421320 doi PQ20160719 (DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest DE-627 ger DE-627 rakwb eng 620 004 DNB 54.00 bkl 05.00 bkl Li, Hang verfasserin aut Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory Huang, Chuan oth Zhang, Ping oth Cui, Shuguang oth Zhang, Junshan oth Enthalten in IEEE ACM transactions on networking New York, NY : IEEE, 1993 24(2016), 3, Seite 1618-1631 (DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 1063-6692 nnns volume:24 year:2016 number:3 pages:1618-1631 http://dx.doi.org/10.1109/TNET.2015.2421320 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 54.00 AVZ 05.00 AVZ AR 24 2016 3 1618-1631 |
| spelling |
10.1109/TNET.2015.2421320 doi PQ20160719 (DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest DE-627 ger DE-627 rakwb eng 620 004 DNB 54.00 bkl 05.00 bkl Li, Hang verfasserin aut Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory Huang, Chuan oth Zhang, Ping oth Cui, Shuguang oth Zhang, Junshan oth Enthalten in IEEE ACM transactions on networking New York, NY : IEEE, 1993 24(2016), 3, Seite 1618-1631 (DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 1063-6692 nnns volume:24 year:2016 number:3 pages:1618-1631 http://dx.doi.org/10.1109/TNET.2015.2421320 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 54.00 AVZ 05.00 AVZ AR 24 2016 3 1618-1631 |
| allfields_unstemmed |
10.1109/TNET.2015.2421320 doi PQ20160719 (DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest DE-627 ger DE-627 rakwb eng 620 004 DNB 54.00 bkl 05.00 bkl Li, Hang verfasserin aut Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory Huang, Chuan oth Zhang, Ping oth Cui, Shuguang oth Zhang, Junshan oth Enthalten in IEEE ACM transactions on networking New York, NY : IEEE, 1993 24(2016), 3, Seite 1618-1631 (DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 1063-6692 nnns volume:24 year:2016 number:3 pages:1618-1631 http://dx.doi.org/10.1109/TNET.2015.2421320 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 54.00 AVZ 05.00 AVZ AR 24 2016 3 1618-1631 |
| allfieldsGer |
10.1109/TNET.2015.2421320 doi PQ20160719 (DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest DE-627 ger DE-627 rakwb eng 620 004 DNB 54.00 bkl 05.00 bkl Li, Hang verfasserin aut Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory Huang, Chuan oth Zhang, Ping oth Cui, Shuguang oth Zhang, Junshan oth Enthalten in IEEE ACM transactions on networking New York, NY : IEEE, 1993 24(2016), 3, Seite 1618-1631 (DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 1063-6692 nnns volume:24 year:2016 number:3 pages:1618-1631 http://dx.doi.org/10.1109/TNET.2015.2421320 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 54.00 AVZ 05.00 AVZ AR 24 2016 3 1618-1631 |
| allfieldsSound |
10.1109/TNET.2015.2421320 doi PQ20160719 (DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest DE-627 ger DE-627 rakwb eng 620 004 DNB 54.00 bkl 05.00 bkl Li, Hang verfasserin aut Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory Huang, Chuan oth Zhang, Ping oth Cui, Shuguang oth Zhang, Junshan oth Enthalten in IEEE ACM transactions on networking New York, NY : IEEE, 1993 24(2016), 3, Seite 1618-1631 (DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 1063-6692 nnns volume:24 year:2016 number:3 pages:1618-1631 http://dx.doi.org/10.1109/TNET.2015.2421320 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 54.00 AVZ 05.00 AVZ AR 24 2016 3 1618-1631 |
| language |
English |
| source |
Enthalten in IEEE ACM transactions on networking 24(2016), 3, Seite 1618-1631 volume:24 year:2016 number:3 pages:1618-1631 |
| sourceStr |
Enthalten in IEEE ACM transactions on networking 24(2016), 3, Seite 1618-1631 volume:24 year:2016 number:3 pages:1618-1631 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
IEEE ACM transactions on networking |
| authorswithroles_txt_mv |
Li, Hang @@aut@@ Huang, Chuan @@oth@@ Zhang, Ping @@oth@@ Cui, Shuguang @@oth@@ Zhang, Junshan @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
165670215 |
| dewey-sort |
3620 |
| id |
OLC1978366302 |
| 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">OLC1978366302</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220219084604.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160719s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TNET.2015.2421320</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160719</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1978366302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1978366302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest</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="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Hang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach</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">This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimal stopping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Batteries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transmitters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data communication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Energy harvesting</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Energy states</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Chuan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cui, Shuguang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Junshan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE ACM transactions on networking</subfield><subfield code="d">New York, NY : IEEE, 1993</subfield><subfield code="g">24(2016), 3, Seite 1618-1631</subfield><subfield code="w">(DE-627)165670215</subfield><subfield code="w">(DE-600)1150634-9</subfield><subfield code="w">(DE-576)034200843</subfield><subfield code="x">1063-6692</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1618-1631</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TNET.2015.2421320</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=7097093</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://arxiv.org/abs/1502.07598</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">05.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2016</subfield><subfield code="e">3</subfield><subfield code="h">1618-1631</subfield></datafield></record></collection>
|
| author |
Li, Hang |
| spellingShingle |
Li, Hang ddc 620 bkl 54.00 bkl 05.00 misc optimal stopping misc Batteries misc Transmitters misc Distributed opportunistic scheduling misc Data communication misc Energy harvesting misc Throughput misc Optimal scheduling misc Energy states misc Computer Science misc Information Theory Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| authorStr |
Li, Hang |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165670215 |
| 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 |
1063-6692 |
| topic_title |
620 004 DNB 54.00 bkl 05.00 bkl Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach optimal stopping Batteries Transmitters Distributed opportunistic scheduling Data communication Energy harvesting Throughput Optimal scheduling Energy states Computer Science Information Theory |
| topic |
ddc 620 bkl 54.00 bkl 05.00 misc optimal stopping misc Batteries misc Transmitters misc Distributed opportunistic scheduling misc Data communication misc Energy harvesting misc Throughput misc Optimal scheduling misc Energy states misc Computer Science misc Information Theory |
| topic_unstemmed |
ddc 620 bkl 54.00 bkl 05.00 misc optimal stopping misc Batteries misc Transmitters misc Distributed opportunistic scheduling misc Data communication misc Energy harvesting misc Throughput misc Optimal scheduling misc Energy states misc Computer Science misc Information Theory |
| topic_browse |
ddc 620 bkl 54.00 bkl 05.00 misc optimal stopping misc Batteries misc Transmitters misc Distributed opportunistic scheduling misc Data communication misc Energy harvesting misc Throughput misc Optimal scheduling misc Energy states misc Computer Science misc Information Theory |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
c h ch p z pz s c sc j z jz |
| hierarchy_parent_title |
IEEE ACM transactions on networking |
| hierarchy_parent_id |
165670215 |
| dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
IEEE ACM transactions on networking |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165670215 (DE-600)1150634-9 (DE-576)034200843 |
| title |
Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| ctrlnum |
(DE-627)OLC1978366302 (DE-599)GBVOLC1978366302 (PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30 (KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest |
| title_full |
Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| author_sort |
Li, Hang |
| journal |
IEEE ACM transactions on networking |
| journalStr |
IEEE ACM transactions on networking |
| 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 |
1618 |
| author_browse |
Li, Hang |
| container_volume |
24 |
| class |
620 004 DNB 54.00 bkl 05.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Li, Hang |
| doi_str_mv |
10.1109/TNET.2015.2421320 |
| dewey-full |
620 004 |
| title_sort |
distributed opportunistic scheduling for energy harvesting based wireless networks: a two-stage probing approach |
| title_auth |
Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| abstract |
This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. |
| abstractGer |
This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. |
| abstract_unstemmed |
This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_151 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 |
| container_issue |
3 |
| title_short |
Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach |
| url |
http://dx.doi.org/10.1109/TNET.2015.2421320 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7097093 http://arxiv.org/abs/1502.07598 |
| remote_bool |
false |
| author2 |
Huang, Chuan Zhang, Ping Cui, Shuguang Zhang, Junshan |
| author2Str |
Huang, Chuan Zhang, Ping Cui, Shuguang Zhang, Junshan |
| ppnlink |
165670215 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1109/TNET.2015.2421320 |
| up_date |
2024-07-03T21:29:41.944Z |
| _version_ |
1803594950977257473 |
| 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">OLC1978366302</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220219084604.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160719s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TNET.2015.2421320</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160719</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1978366302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1978366302</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a1628-3c5d0cdbf5f4f201c8bb6090e755707cfb4e4ad2718aa9f512080dac89a098c30</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0226258420160000024000301618distributedopportunisticschedulingforenergyharvest</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="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Hang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless Networks: A Two-Stage Probing Approach</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">This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI) and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration: First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimal stopping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Batteries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transmitters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed opportunistic scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data communication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Energy harvesting</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimal scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Energy states</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Chuan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cui, Shuguang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Junshan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE ACM transactions on networking</subfield><subfield code="d">New York, NY : IEEE, 1993</subfield><subfield code="g">24(2016), 3, Seite 1618-1631</subfield><subfield code="w">(DE-627)165670215</subfield><subfield code="w">(DE-600)1150634-9</subfield><subfield code="w">(DE-576)034200843</subfield><subfield code="x">1063-6692</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1618-1631</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TNET.2015.2421320</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=7097093</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://arxiv.org/abs/1502.07598</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">05.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2016</subfield><subfield code="e">3</subfield><subfield code="h">1618-1631</subfield></datafield></record></collection>
|
| score |
7.399618 |