This paper presents average waiting time analysis in Cognitive Radio with and without relaying capability. We perform theoretical analysis by applying M/D/1 queuing scheme in order to find the waiting time in queue. Result indicates that the benefits of relaying for primary link depends on the data

University. In this manuscript I explore the underlying distributions for the waiting times between flares for each of the groups I am comparing: African-Americans versus Caucasians, and renal versus non-renal lupus patients. Because of the large number of censored datapoints, survival analysis is the most

the computed traffic load with minimum average waiting time. This time can be used to logically regulate the traffic flow on the roads. Relationship has been analysed between minimum average waiting time and the quantum time allotted to each side of the intersection point to release the traffic load.

of round robin algorithm performs better than the conventional round robin algorithm in terms various performance metrics such as number of context switches, average waiting and turnaround time.

Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks

returns are negatively related over time to contemporaneous unexpected illiquidity. The illiquidity measure here is the average across stocks of the daily ratio of absolute stock return to dollar volume, which is easily obtained from daily stock data for long time series in most stock markets. Illiquidity

In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or

We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a

, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should

Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become