18 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
Mobility in wireless sensor networks : advantages, limitations and effects
The primary aim of this thesis is to study the benefits and limitations of using a mobile base station for data gathering in wireless sensor networks. The case of a single mobile base station and mobile relays are considered.
A cluster-based algorithm to determine the trajectory of a mobile base station for data gathering within a specified delay time is presented. The proposed algorithm aims for an equal number of sensors in each cluster in order to achieve load balance among the cluster heads. It is shown that there is a tradeoff between data-gathering delay and balancing energy consumption among sensor nodes. An analytical solution to the problem is provided in terms of the speed of the mobile base station. Simulation is performed to evaluate the performance of the proposed algorithm against the static case and to evaluate the distribution of energy consumption among the cluster heads. It is demonstrated that the use of clustering with a mobile base station can improve the network lifetime and that the proposed algorithm balances energy consumption among cluster heads. The effect of the base station velocity on the number of packet losses is studied and highlights the limitation of using a mobile base station for a large-scale network.
We consider a scenario where a number of mobile relays roam through the sensing field and have limited energy resources that cannot reach each other directly. A routing scheme based on the multipath protocol is proposed, and explores how the number of paths and spread of neighbour nodes used by the mobile relays to communicate affects the network overhead. We introduce the idea of allowing the source mobile relay to cache multiple routes to the destination through its neighbour nodes in order to provide redundant paths to destination. An analytical model of network overhead is developed and verified by simulation. It is shown that the desirable number of routes is dependent on the velocity of the mobile relays. In most cases the network overhead is minimized when the source mobile relay caches six paths via appropriately distributed neighbours at the destination.
A new technique for estimating routing-path hop count is also proposed. An analytical model is provided to estimate the hop count between source-destination pairs in a wireless network with an arbitrary node degree when the network nodes are uniformly distributed in the sensing field. The proposed model is a significant improvement over existing models, which do not correctly address the low-node density situation
Research and technology highlights, 1993
This report contains highlights of the major accomplishments and applications that have been made by Langley researchers and by our university and industry colleagues during the past year. The highlights illustrate both the broad range of the research and technology activities supported by NASA Langley Research Center and the contributions of this work toward maintaining United States leadership in aeronautics and space research. This report also describes some of the Center's most important research and testing facilities
Using MapReduce Streaming for Distributed Life Simulation on the Cloud
Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp
1995-1996 Louisiana Tech University Catalog
The Louisiana Tech University Catalog includes announcements and course descriptions for courses offered at Louisiana Tech University for the academic year of 1995-1996.https://digitalcommons.latech.edu/university-catalogs/1019/thumbnail.jp