Stochastic backlog and delay bounds of generic rate-based AIMD congestion control scheme in cognitive radio sensor networks
| Autor: | Reza Berangi, Elahe S. Hosseini, Ozgur B. Akan, Vahid Esmaeelzadeh |
|---|---|
| Přispěvatelé: | Akan, Özgür Barış, Esmaeelzadeh, Vahid, Berangi, Reza, Hosseini, Elahe S., Next-generation and Wireless Communications Laboratory (NWCL), College of Engineering |
| Rok vydání: | 2015 |
| Předmět: |
Scheme (programming language)
Mathematical optimization Computer Networks and Communications Computer science Quality of service Bandwidth (signal processing) Multiplicative function Probabilistic logic Telecommunications Moment-generating function Computer Science Applications Network congestion Hardware and Architecture Computer Science::Networking and Internet Architecture Network calculus computer Software Stochastic network calculus Backlog bound Delay bound Cognitive radio sensor networks Rate-based congestion control AIMD Information Systems computer.programming_language |
| Zdroj: | Pervasive and Mobile Computing |
| ISSN: | 1574-1192 |
| DOI: | 10.1016/j.pmcj.2015.02.005 |
| Popis: | Performance guarantees for congestion control schemes in cognitive radio sensor networks (CRSNs) can be helpful in order to satisfy the quality of service (QoS) in different applications. Because of the high dynamicity of available bandwidth and network resources in CRSNs, it is more effective to use the stochastic guarantees. In this paper, the stochastic backlog and delay bounds of generic rate-based additive increase and multiplicative decrease (AIMD) congestion control scheme are modeled based on stochastic network calculus (SNC). Particularly, the probabilistic bounds are modeled through moment generating function (MGF)-based SNC with regard to the sending rate distribution of CR source sensors. The proposed stochastic bounds are verified through NS2-based simulations. Iran Telecommunication Research Center (ITRC) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect