Skip to main content

Distributed Scheduling in Wireless Multiple Decode-and-Forward Relay Networks

  • Conference paper
  • First Online:
IoT as a Service (IoTaaS 2019)

Included in the following conference series:

  • 807 Accesses

Abstract

In this paper, we study the distributed DOS problem for wireless multiple relay networks. Formulating the problem as an extended three-level optimal stopping problem, an optimal strategy is proposed guiding distributed channel access for multiple source-to-destination communications under the help of multiple relays. The optimality of the strategy is rigorously proved, and abides by a tri-level structure of pure threshold. For network operation, easy implementation is presented of low complexity. The close-form expression of the maximal expected system throughput is also derived. Furthermore, numerical results are provided to demonstrate the correctness of our analytical expressions, and the effectiveness is verified.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note the superscript \(\overline{\infty }\) means the summation includes term at \(n=\infty \).

  2. 2.

    For finite n, the existence proof is similar to Theorem 6, while \(n=\infty \) means the main layer does not stop.

References

  1. Andrews, M., Kumaran, K., Ramanan, K., Stolyar, A., Whiting, P., Vijayakumar, R.: Providing quality of service over a shared wireless link. IEEE Commun. Mag. 39(2), 150–154 (2001)

    Article  Google Scholar 

  2. Viswanath, P., Tse, D.N.C., Laroia, R.: Opportunistic beamforming using dumb antennas. IEEE Trans. Inf. Theory 48(6), 1277–1294 (2002)

    Article  MathSciNet  Google Scholar 

  3. Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad hoc networks with random access: an optimal stopping approach. IEEE Trans. Inf. Theory 55(1), 205–222 (2009)

    Article  MathSciNet  Google Scholar 

  4. Ge, W., Zhang, J., Wieselthier, J., Shen, X.: PHY-aware distributed scheduling for ad hoc communications with physical interference model. IEEE Trans. Wirel. Commun. 8(5), 2682–2693 (2009)

    Article  Google Scholar 

  5. Tan, S., Zheng, D., Zhang, J., Zeidler, J.: Distributed opportunistic scheduling for ad-hoc communications under delay constraints. In: Proceedings of IEEE INFOCOM 2010 (2010)

    Google Scholar 

  6. Xie, L.L., Kumar, P.R.: An achievable rate for the multiple-level relay channel. IEEE Trans. Inf. Theory 51(4), 1348–1358 (2005)

    Article  MathSciNet  Google Scholar 

  7. Laneman, J.N., Tse, D.N.C., Wornell, G.W.: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory 50, 3062–3080 (2004)

    Article  MathSciNet  Google Scholar 

  8. Zhang, J., Jia, J., Zhang, Q., Lo, E.M.K.: Implementation and evaluation of cooperative communication schemes in software-defined radio testbed. In: Proceedings of IEEE INFOCOM 2010 (2010)

    Google Scholar 

  9. Zhang, Q., Jia, J., Zhang, J.: Cooperative relay to improve diversity in cognitive radio networks. IEEE Commun. Mag. 47(2), 111–117 (2009)

    Article  MathSciNet  Google Scholar 

  10. Gunduz, D., Erkip, E.: Opportunistic cooperation by dynamic resource allocation. IEEE Trans. Wirel. Commun. 6(4), 1446–1454 (2007)

    Article  Google Scholar 

  11. Jing, Y., Jafarkhani, H.: Network beamforming using relays with perfect channel information. IEEE Trans. Inf. Theory 55(6), 2499–2517 (2009)

    Article  MathSciNet  Google Scholar 

  12. Zhang, Z., Jiang, H.: Distributed opportunistic channel access in wireless relay networks. IEEE J. Sel. Areas Commun. 30(9), 1675–1683 (2012)

    Article  Google Scholar 

  13. Zhang, Z., Zhou, S., Jiang, H., Dong, L.: Opportunistic cooperative channel access in distributed wireless networks with decode-and-forward relays. IEEE Commun. Lett. 19(10), 1778–1781 (2015)

    Article  Google Scholar 

  14. Ferguson, T.: Optimal stopping and applications. Mathematics Department, UCLA. http://www.math.ucla.edu/~tom/Stopping/Contents.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhou Zhang .

Editor information

Editors and Affiliations

A Proof of Lemma 1

A Proof of Lemma 1

For relay number \(k\in \{1,2,...,L\}\), we define \(r_n':=r_n\!-\!P_s|h(n)|^2\). For function \(Z_k\), the first-order derivative is calculated as that

$$\begin{aligned}&\frac{\partial {Z}_k}{\partial r_n'}=\tau _d\Big (\frac{\log _2e}{1\!+\!r_n'\!+\!P_s|h(n)|^2}\big (1\!-\!(1-e^{-\frac{r_n'}{\sigma _g^2}})^k\big ) -\frac{1}{\sigma _g^2}e^{-\frac{r_n'}{\sigma _g^2}} \\ {}&~~~~ (1\!-\!e^{-\frac{r_n'}{\sigma _g^2}})^{k-1}k \big (\log _2(1\!+\!r_n'\!+\!P_s|h(n)|^2)-\lambda \big )\Big ). \end{aligned}$$

By replacing \(1\!-\!e^{-\frac{r_n'}{\sigma _g^2}}\) with \(y(r_n')\), the derivative is rewritten in Eq. (15).

$$\begin{aligned} \begin{aligned}&\frac{\partial {Z}_k}{\partial r_n'} = (1\!-\!y(r_n')) ky^{1\!-\!k}(r_n')\Big (\!-\frac{\tau _d}{\sigma _g^2} \left( \log _2(1\!+\!r_n'\!+\!P_s|h(n)|^2) -\!\lambda \big ) \right. \\&\left. \quad \quad \quad +\tau _d\log _2e \frac{1}{k}\sum \limits _{i=0}^{k-1}y^{-i}(\bar{R}_n)\frac{1}{1+r_n'\!+\!P_s|h(n)|^2} \right) . \end{aligned} \end{aligned}$$
(15)

In the region \(r_n'\!\ge \!0\), the factor in Eq. (15) satisfies \((1-y(r_n'))y^{1-k}(r_n')>0\). Therefore, it suffices to compare \(\frac{\tau _d\log _2e}{1+r_n'+P_s|h(n)|^2} \sum \limits _{i=0}^{k-1}y^{-i}(r_n')\) and \(\frac{1}{\sigma _g^2} k \big (\log _2(1\!+\!r_n'\!+\!P_s|h(n)|^2)\tau _d\!-\!\lambda \tau _d\big )\) to determine the derivative.

It can be proved that \(\sum \limits _{i=0}^{k-1}y^{-i}(r_n')\frac{1}{1+r_n'+P_s|h(n)|^2}\) is decreasing and \(\log _2(1+r_n'+P_s|h(n)|^2)-\lambda \) is increasing in \(r_n'\!\ge \!0\), respectively. Meanwhile, as \(r_n'\) is large, \(\sum \limits _{i=0}^{k-1}y^{-i}(r_n')\) will approach to k and \(\frac{1}{1+r_n'+P_s|h(n)|^2}\) is small, while \(\{\log _2(1+r_n'+P_s|h(n)|^2)\tau _d-\lambda \tau _d'\}\) is large. Thus, the existence of stationary point, denoted by \(\zeta _k\!-\!P_s|h(n)|^2\) is guaranteed, which are unique such that \(\frac{\partial {Z}_k}{\partial r_n'}\!=\!0\).

As a result, function \(Z_k\) increases in \(r_n\!<\!\zeta _k\), and decreases in \(r_n\!\ge \!\zeta _k\).

Then, relation of these points \(\{\zeta _k\},k=1,2,...,L\) is further investigated.

For \(k\!>\!1\), by valuing \(r_n'\!=\!0\), we have the derivative satisfy

$$\begin{aligned} \frac{\partial {Z}_k}{\partial r_n'}\big |_{r_n'=0}=\frac{\log _2e\cdot \tau _d }{1\!+\!P_s|h(n)|^2}> 0.\end{aligned}$$
(16)

which means \({\zeta }_k\!>\!P_s|h(n)|^2\).

For \(k\!=\!1\), we have the derivative satisfy that

$$\begin{aligned} \frac{\partial {Z}_k}{\partial r_n'}\!\big |_{r_n'\!=\!0} = \frac{\tau _d\log _2e}{1\!+\!P_s|h(n)|^2} \!-\!\frac{\log _2(1\!+\!P_s|h(n)|^2)\tau _d\!-\!\lambda \tau _d}{\sigma _g^2}. \end{aligned}$$
(17)

Suppose \(\zeta _1\) satisfies \(\frac{\partial {Z}_k}{\partial r_n'}=0\), we compare the points \(\{\zeta _1,\zeta _2,...,\zeta _L\}\). The situation where \(\zeta _1\!=\!P_s|h_{s(n)}(n)|^2\) is similar as \({\zeta }_k\!>\!P_s|h_{s(n)}(n)|^2\) for \(\forall k\ge 2\).

Since \(\zeta _k\) such that \(\frac{\partial {Z}_k}{\partial \bar{R}_n}\!=\!0\), by induction it suffices from (15) to compare \(\frac{1}{k}\sum \limits _{i=0}^{k-1}y^{-i}(r_n')\).

Based the relation shown in the following that

$$\begin{aligned}&\frac{1}{k}\sum \limits _{i=0}^{k-1}y^{-i}(r_n')-\frac{1}{k+1} \sum \limits _{i=0}^{k}y^{-i}(r_n')\\&~~~~~~~~ =\frac{1}{k(k+1)}\big (\sum \limits _{i=0}^{k-1}y^{-i}(r_n') -k y^{-k}(r_n')\big )<0 \end{aligned}$$

it proves that \(\zeta _k<\zeta _{k+1}\) for \(\forall k=1,2,...,L\!-\!1\). In other words, \(\zeta _1<\zeta _2<...<\zeta _L\).

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Z., Yan, Y., Sang, W., Xu, Z. (2020). Distributed Scheduling in Wireless Multiple Decode-and-Forward Relay Networks. In: Li, B., Zheng, J., Fang, Y., Yang, M., Yan, Z. (eds) IoT as a Service. IoTaaS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 316. Springer, Cham. https://doi.org/10.1007/978-3-030-44751-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44751-9_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44750-2

  • Online ISBN: 978-3-030-44751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics