Uniqueness of positive solutions for a class of p-Laplacion problems
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-3-163,
author = {},
title = {Uniqueness of positive solutions for a class of p-Laplacion problems},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {3},
number = {3},
pages = {163--172},
abstract = {We consider link error or physical channel error in wireless networks and propose a new rate-
based congestion control scheme for wireless networks, which is based on the NUM framework developed
for TCP-like congestion control model in wired networks. This scheme is distributed and can be implemented
by changing the number of connections opened by one user and requires no modification to either the
network infrastructure, or the network protocols. The scheme is proved to be global stability in the absence of
round trip delay of each user and all trajectories can converge to the unique equilibrium point. The
convergence rate is also studied and stochastic disturbance is analyzed. Furthermore, a sufficient condition is
obtained under which the scheme is locally stable at the equilibrium point in the presence of delay based on
the general Nyquist criterion of stability.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22766.html}
}
TY - JOUR
T1 - Uniqueness of positive solutions for a class of p-Laplacion problems
AU -
JO - Journal of Information and Computing Science
VL - 3
SP - 163
EP - 172
PY - 2024
DA - 2024/01
SN - 3
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22766.html
KW - wireless networks, congestion control, convergence, stability, Nyquist.
AB - We consider link error or physical channel error in wireless networks and propose a new rate-
based congestion control scheme for wireless networks, which is based on the NUM framework developed
for TCP-like congestion control model in wired networks. This scheme is distributed and can be implemented
by changing the number of connections opened by one user and requires no modification to either the
network infrastructure, or the network protocols. The scheme is proved to be global stability in the absence of
round trip delay of each user and all trajectories can converge to the unique equilibrium point. The
convergence rate is also studied and stochastic disturbance is analyzed. Furthermore, a sufficient condition is
obtained under which the scheme is locally stable at the equilibrium point in the presence of delay based on
the general Nyquist criterion of stability.
. (2024). Uniqueness of positive solutions for a class of p-Laplacion problems.
Journal of Information and Computing Science. 3 (3).
163-172.
doi:
Copy to clipboard