46,223 research outputs found
Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation
Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters
Asterias: a parallelized web-based suite for the analysis of expression and aCGH data
Asterias (\url{http://www.asterias.info}) is an integrated collection of
freely-accessible web tools for the analysis of gene expression and aCGH data.
Most of the tools use parallel computing (via MPI). Most of our applications
allow the user to obtain additional information for user-selected genes by
using clickable links in tables and/or figures. Our tools include:
normalization of expression and aCGH data; converting between different types
of gene/clone and protein identifiers; filtering and imputation; finding
differentially expressed genes related to patient class and survival data;
searching for models of class prediction; using random forests to search for
minimal models for class prediction or for large subsets of genes with
predictive capacity; searching for molecular signatures and predictive genes
with survival data; detecting regions of genomic DNA gain or loss. The
capability to send results between different applications, access to additional
functional information, and parallelized computation make our suite unique and
exploit features only available to web-based applications.Comment: web based application; 3 figure
Combining Static and Dynamic Analysis for Vulnerability Detection
In this paper, we present a hybrid approach for buffer overflow detection in
C code. The approach makes use of static and dynamic analysis of the
application under investigation. The static part consists in calculating taint
dependency sequences (TDS) between user controlled inputs and vulnerable
statements. This process is akin to program slice of interest to calculate
tainted data- and control-flow path which exhibits the dependence between
tainted program inputs and vulnerable statements in the code. The dynamic part
consists of executing the program along TDSs to trigger the vulnerability by
generating suitable inputs. We use genetic algorithm to generate inputs. We
propose a fitness function that approximates the program behavior (control
flow) based on the frequencies of the statements along TDSs. This runtime
aspect makes the approach faster and accurate. We provide experimental results
on the Verisec benchmark to validate our approach.Comment: There are 15 pages with 1 figur
Collaborative spectrum sensing optimisation algorithms for cognitive radio networks
The main challenge for a cognitive radio is to detect the existence of primary users reliably in order to minimise the interference to licensed communications. Hence, spectrum sensing is a most important requirement of a cognitive radio. However, due to the channel uncertainties, local observations are not reliable and collaboration among users is required. Selection of fusion rule at a common receiver has a direct impact on the overall spectrum sensing performance. In this paper, optimisation of collaborative spectrum sensing in terms of optimum decision fusion is studied for hard and soft decision combining. It is concluded that for optimum fusion, the fusion centre must incorporate signal-to-noise ratio values of cognitive users and the channel conditions. A genetic algorithm-based weighted optimisation strategy is presented for the case of soft decision combining. Numerical results show that the proposed optimised collaborative spectrum sensing schemes give better spectrum sensing performance
Combining Spot and Futures Markets: A Hybrid Market Approach to Dynamic Spectrum Access
Dynamic spectrum access is a new paradigm of secondary spectrum utilization
and sharing. It allows unlicensed secondary users (SUs) to exploit
opportunistically the under-utilized licensed spectrum. Market mechanism is a
widely-used promising means to regulate the consuming behaviours of users and,
hence, achieves the efficient allocation and consumption of limited resources.
In this paper, we propose and study a hybrid secondary spectrum market
consisting of both the futures market and the spot market, in which SUs
(buyers) purchase under-utilized licensed spectrum from a spectrum regulator,
either through predefined contracts via the futures market, or through spot
transactions via the spot market. We focus on the optimal spectrum allocation
among SUs in an exogenous hybrid market that maximizes the secondary spectrum
utilization efficiency. The problem is challenging due to the stochasticity and
asymmetry of network information. To solve this problem, we first derive an
off-line optimal allocation policy that maximizes the ex-ante expected spectrum
utilization efficiency based on the stochastic distribution of network
information. We then propose an on-line VickreyCClarkeCGroves (VCG) auction
that determines the real-time allocation and pricing of every spectrum based on
the realized network information and the pre-derived off-line policy. We
further show that with the spatial frequency reuse, the proposed VCG auction is
NP-hard; hence, it is not suitable for on-line implementation, especially in a
large-scale market. To this end, we propose a heuristics approach based on an
on-line VCG-like mechanism with polynomial-time complexity, and further
characterize the corresponding performance loss bound analytically. We finally
provide extensive numerical results to evaluate the performance of the proposed
solutions.Comment: This manuscript is the complete technical report for the journal
version published in INFORMS Operations Researc
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
- …