1,127 research outputs found
Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous
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 perform channel hopping. There exists a trade-off of optimizing the average
or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH
protocol leads to the best "average" TTR without ensuring a finite "maximum"
TTR (two CRs may never rendezvous in the worst case), or a high rendezvous
diversity (multiple rendezvous channels). On the other hand, many
sequence-based CH protocols ensure a finite maximum TTR (upper bound of TTR)
and a high rendezvous diversity, while they inevitably yield a larger average
TTR. In this paper, we strike a balance in the average-maximum TTR trade-off
for CR rendezvous by leveraging the advantages of both random and
sequence-based CH protocols. Inspired by the neighbor discovery problem, we
establish a design framework of creating a wake-up schedule whereby every CR
follows the sequence-based (or random) CH protocol in the awake (or asleep)
mode. Analytical and simulation results show that the hybrid CH protocols under
this framework are able to achieve a greatly improved average TTR as well as a
low upper-bound of TTR, without sacrificing the rendezvous diversity.Comment: Accepted by IEEE International Conference on Communications (ICC
2015, http://icc2015.ieee-icc.org/
Bootstrapping Cognitive Radio Networks
Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information. To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques. To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create ariii guments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment
Facilitating Flexible Link Layer Protocols for Future Wireless Communication Systems
This dissertation addresses the problem of designing link layer protocols
which are flexible enough to accommodate the demands offuture wireless
communication systems (FWCS).We show that entire link layer protocols with
diverse requirements and responsibilities can be composed out of
reconfigurable and reusable components.We demonstrate this by designing and
implementinga novel concept termed Flexible Link Layer (FLL)
architecture.Through extensive simulations and practical experiments, we
evaluate a prototype of the suggested architecture in both
fixed-spectrumand dynamic spectrum access (DSA) networks.
FWCS are expected to overcome diverse challenges including the continual
growthin traffic volume and number of connected devices.Furthermore, they
are envisioned to support a widerange of new application requirements and
operating conditions.Technology trends, including smart homes,
communicating machines, and vehicularnetworks, will not only grow on a
scale that once was unimaginable, they will also become the predominant
communication paradigm, eventually surpassing today's human-produced
network traffic.
In order for this to become reality, today's systems have to evolve in many
ways.They have to exploit allocated resources in a more efficient and
energy-conscious manner.In addition to that, new methods for spectrum
access and resource sharingneed to be deployed.Having the diversification
of applications and network conditions in mind, flexibility at all layers
of a communication system is of paramount importance in order to meet the
desired goals.
However, traditional communication systems are often designed with specific
and distinct applications in mind. Therefore, system designers can tailor
communication systems according to fixedrequirements and operating
conditions, often resulting in highly optimized but inflexible
systems.Among the core problems of such design is the mix of data transfer
and management aspects.Such a combination of concerns clearly hinders the
reuse and extension of existing protocols.
To overcome this problem, the key idea explored in this dissertation is a
component-based design to facilitate the development of more flexible and
versatile link layer protocols.Specifically, the FLL architecture,
suggested in this dissertation, employs a generic, reconfigurable data
transfer protocol around which one or more complementary protocols, called
link layer applications, are responsible for management-related aspects of
the layer.
To demonstrate the feasibility of the proposed approach, we have designed
andimplemented a prototype of the FLL architecture on the basis ofa
reconfigurable software defined radio (SDR) testbed.Employing the SDR
prototype as well as computer simulations, thisdissertation describes
various experiments used to examine a range of link layerprotocols for both
fixed-spectrum and DSA networks.
This dissertation firstly outlines the challenges faced by FWCSand
describes DSA as a possible technology component for their construction.It
then specifies the requirements for future DSA systemsthat provide the
basis for our further considerations.We then review the background on link
layer protocols, surveyrelated work on the construction of flexible
protocol frameworks,and compare a range of actual link layer protocols and
algorithms.Based on the results of this analysis, we design, implement, and
evaluatethe FLL architecture and a selection of actual link layer
protocols.
We believe the findings of this dissertation add substantively to the
existing literature on link layer protocol design and are valuable for
theoreticians and experimentalists alike
DISTRIBUTED INTELLIGENT SPECTRUM MANAGEMENT IN COGNITIVE RADIO AD HOC NETWORKS
The rapid growth of the number of wireless devices has brought an exponential increase in the demand of the radio spectrum. However, according to the Federal Communications Commission (FCC), almost all the radio spectrum for wireless com- munications has already been allocated. In addition, according to FCC, up to 85% of the allocated spectrum is underutilized due to the current fixed spectrum alloca- tion policy. To alleviate the spectrum scarcity problem, FCC has suggested a new paradigm for dynamically accessing the allocated spectrum. Cognitive radio (CR) technology has emerged as a promising solution to realize dynamic spectrum access (DSA). With the capability of sensing the frequency bands in a time and location- varying spectrum environment and adjusting the operating parameters based on the sensing outcome, CR technology allows an unlicensed user to exploit the licensed channels which are not used by licensed users in an opportunistic manner.
In this dissertation, distributed intelligent spectrum management in CR ad hoc networks is explored. In particular, four spectrum management issues in CR ad hoc networks are investigated: 1) distributed broadcasting in CR ad hoc networks; 2) distributed optimal HELLO message exchange in CR ad hoc networks; 3) distributed protocol to defend a particular network security attack in CR ad hoc networks; and 4) distributed spectrum handoff protocol in CR ad hoc networks. The research in this dissertation has fundamental impact on CR ad hoc network establishment, net- work functionality, network security, and network performance. In addition, many of the unique challenges of distributed intelligent spectrum management in CR ad hoc networks are addressed for the first time in this dissertation. These challenges are extremely difficult to solve due to the dynamic spectrum environment and they have significant effects on network functionality and performance. This dissertation
is essential for establishing a CR ad hoc network and realizing networking protocols for seamless communications in CR ad hoc networks. Furthermore, this dissertation provides critical theoretical insights for future designs in CR ad hoc networks
Frequency Rendezvous and Physical Layer Network Coding for Distributed Wireless Networks
In this thesis, a transmission frequency rendezvous approach for secondary users deployed in decentralized dynamic spectrum access networks is proposed. Frequency rendezvous is a critical step in bootstrapping a wireless network that does not possess centralized control. Current techniques for enabling frequency rendezvous in decentralized dynamic spectrum access networks either require pre-existing infrastructure or use one of several simplifying assumptions regarding the architecture, such as the use of regularly spaced frequency channels for communications. Our proposed approach is designed to be operated in a strictly decentralized wireless networking environment, where no centralized control is present and the spectrum does not possess pre-defined channels. In our proposed rendezvous algorithm, the most important step is pilot tone detection and receiver query. In order to realize a shortest search time for the target receiver, an efficient scanning rule should be employed. In this thesis, three scanning rules are proposed and evaluated, namely: frequency sequence scanning, pilot tone strength scanning, and cluster scanning. To validate our result, we test our scanning rules with actual paging band spectrum measurements. Previous research on security of network coding focuses on the protection of data dissemination procedures and the detection of malicious activities such as pollusion attacks. The capabilities of network coding to detect other attacks has not been fully explored. In this thesis, a new mechanism based on physical layer network coding to detect wormhole attacks is proposed. When two signal sequences collide at the receiver, the difference between the two received sequences is determined by its distances to the senders. Therefore, by comparing the differences between the received sequences at two nodes, we can estimate the distance between them and detect those fake neighbor connections through wormholes. While the basic idea is clear, we design many schemes at both physical and network layers to turn the idea into a practical approach. Simulations using BPSK modulation at the physical layer show that the wireless nodes can effectively detect fake neighbor connections without the adoption of any special hardware on them
Adaptive and autonomous protocol for spectrum identification and coordination in ad hoc cognitive radio network
The decentralised structure of wireless Ad hoc networks makes them most appropriate for quick and easy deployment in military and emergency situations. Consequently, in this thesis, special interest is given to this form of network. Cognitive Radio (CR) is defined as a radio, capable of identifying its spectral environment and able to optimally adjust its transmission parameters to achieve interference free communication channel. In a CR system, Dynamic Spectrum Access (DSA) is made feasible. CR has been proposed as a candidate solution to the challenge of spectrum scarcity. CR works to solve this challenge by providing DSA to unlicensed (secondary) users. The introduction of this new and efficient spectrum management technique, the DSA, has however, opened up some challenges in this wireless Ad hoc Network of interest; the Cognitive Radio Ad Hoc Network (CRAHN). These challenges, which form the specific focus of this thesis are as follows: First, the poor performance of the existing spectrum sensing techniques in low Signal to Noise Ratio (SNR) conditions. Secondly the lack of a central coordination entity for spectrum allocation and information exchange in the CRAHN. Lastly, the existing Medium Access Control (MAC) Protocol such as the 802.11 was designed for both homogeneous spectrum usage and static spectrum allocation technique. Consequently, this thesis addresses these challenges by first developing an algorithm comprising of the Wavelet-based Scale Space Filtering (WSSF) algorithm and the Otsu's multi-threshold algorithm to form an Adaptive and Autonomous WaveletBased Scale Space Filter (AWSSF) for Primary User (PU) sensing in CR. These combined algorithms produced an enhanced algorithm that improves detection in low SNR conditions when compared to the performance of EDs and other spectrum sensing techniques in the literature. Therefore, the AWSSF met the performance requirement of the IEEE 802.22 standard as compared to other approaches and thus considered viable for application in CR. Next, a new approach for the selection of control channel in CRAHN environment using the Ant Colony System (ACS) was proposed. The algorithm reduces the complex objective of selecting control channel from an overtly large spectrum space,to a path finding problem in a graph. We use pheromone trails, proportional to channel reward, which are computed based on received signal strength and channel availability, to guide the construction of selection scheme. Simulation results revealed ACS as a feasible solution for optimal dynamic control channel selection. Finally, a new channel hopping algorithm for the selection of a control channel in CRAHN was presented. This adopted the use of the bio-mimicry concept to develop a swarm intelligence based mechanism. This mechanism guides nodes to select a common control channel within a bounded time for the purpose of establishing communication. Closed form expressions for the upper bound of the time to rendezvous (TTR) and Expected TTR (ETTR) on a common control channel were derived for various network scenarios. The algorithm further provides improved performance in comparison to the Jump-Stay and Enhanced Jump-Stay Rendezvous Algorithms. We also provided simulation results to validate our claim of improved TTR. Based on the results obtained, it was concluded that the proposed system contributes positively to the ongoing research in CRAHN
Interference Mitigation in Frequency Hopping Ad Hoc Networks
Radio systems today exhibit a degree of flexibility that was unheard of only a few years ago. Software-defined radio architectures have emerged that are able to service large swathes of spectrum, covering up to several GHz in the UHF bands. This dissertation investigates interference mitigation techniques in frequency hopping ad hoc networks that are capable of exploiting the frequency agility of software-defined radio platforms
- …