Stochastic backlog and delay bounds of generic rate-based AIMD congestion control scheme in cognitive radio sensor networks

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

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

Markov and Semi-markov Chains, Processes, Systems and Emerging Related Fields

This book covers a broad range of research results in the field of Markov and Semi-Markov chains, processes, systems and related emerging fields. The authors of the included research papers are well-known researchers in their field. The book presents the state-of-the-art and ideas for further research for theorists in the fields. Nonetheless, it also provides straightforwardly applicable results for diverse areas of practitioners