相关论文: Adaptive Quorum-Based Channel-Hopping Distributed …
In this paper, we propose novel channel-hoppingbased distributed rendezvous algorithm based on grid-basedquorum techniques. The proposed algorithm increases the probability of rendezvous (RDV) within a single cycle by allowing CR nodes to…
The multichannel rendezvous problem that asks two secondary users to rendezvous on a common available channel in a cognitive radio network (CRN) has received a lot of attention lately. Most rendezvous algorithms in the literature focused on…
The multi-channel blind rendezvous problem in distributed cognitive radio networks (DCRNs) refers to how users in the network can hop to the same channel at the same time slot without any prior knowledge (i.e., each user is unaware of other…
In cognitive radio (CR) networks, "TTR", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs…
Cognitive radio (CR) technology enables an intelligent wireless communication system. CR provides an efficient solution for the inefficient spectrum utilization by allowing dynamic and opportunistic spectrum access. In designing CR…
In Cognitive Radio Networks (CRNs), the secondary users (SUs) are allowed to access the licensed channels opportunistically. A fundamental and essential operation for SUs is to establish communication through choosing a common channel at…
In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel…
In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that…
In this paper, we consider the joint opportunistic routing and channel assignment problem in multi-channel multi-radio (MCMR) cognitive radio networks (CRNs) for improving aggregate throughput of the secondary users. We first present the…
This paper introduces a new channel selection strategy for reliable contentionaware data dissemination in multi-hop cognitive radio network. The key challenge here is to select channels providing a good tradeoff between connectivity and…
In cognitive radio networks (CRNs), establishing a communication link between a pair of secondary users (SUs) requires them to rendezvous on a common channel which is not occupied by primary users (PUs). Under time-varying PU traffic,…
In Cognitive Radio Networks (CRNs), secondary users (SUs) must efficiently discover each other across multiple communication channels while avoiding interference from primary users (PUs). Traditional multichannel rendezvous algorithms…
We propose a theoretical framework for consistent channel hopping algorithms to address the multichannel rendezvous problem (MRP) in wireless networks with heterogeneous available channel sets. A channel selection function is called…
In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel…
In a densely deployed distributed wireless network, there may be various types of traffic with differentiated Quality of Service (QoS) requirements. However, when the network is heavily loaded, the collision increases significantly, making…
The work proposes a new Combined Routing Protocol (CRP) for ad hoc networks that combines the benefits and annihilates the shortcomings of two well-known on-demand routing protocols in ad hoc networks: AODV (which provides a high…
Cognitive radio (CR) is a promising technology to improve spectrum utilization. However, spectrum availability is uncertain which mainly depends on primary user's (PU's) behaviors. This makes it more difficult for most existing CR routing…
This paper discusses distributed approaches for the solution of random convex programs (RCP). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints; they arise in several applicative areas,…
We study the problem of distributed optimal resource allocation on networks with actions defined on discrete spaces, with applications to adaptive under-frequency load-shedding in power systems. In this context, the primary objective is to…
Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to…