3,176 research outputs found

    A new analytic model for the cognitive radio jump-stay algorithm

    Full text link
    In cognitive radio networks, primary users have priority over the regulated radio spectrum. Secondary users may use residual air time. We focus on the problem of meeting on a common channel by a group of secondary users. The goal is to make the users rendezvous on a common channel in a minimum amount of time. The jump-stay algorithm has been created by Lin et al. to solve this problem. We construct a new analytic model for the two-user expected time to rendezvous in the jump-stay algorithm that better reflects its performance. For the sake of comparison, we also evaluate the performance of the jump-stay algorithm through simulation

    Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks

    Get PDF
    Abstract. We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay ren-dezvous algorithm. It augments the modular clock with a stay-on-one-channel pattern. This enhancement guarantees rendezvous in one round. We make the observation that as the number of channels increases, the significance of the stay-on-one-channel pattern decreases. We revisit the performance analysis of the two-user symmetric case of the modular clock algorithm. We compare its performance with a random and the jump-stay rendezvous algorithms. Let m be the number of channels. Let p be the smallest prime number greater than m. The expected time-to-rendezvous of the random and jump-stay algorithms are m and p, respectively. Theis et al.’s analysis of the modular clock algorithm con-cludes a maximum expected time-to-rendezvous slightly larger than 2p time slots. Our analysis shows that the expected time-to-rendezvous of the modular clock algorithm is no more than 3p/4 time slots.

    Facilitating Flexible Link Layer Protocols for Future Wireless Communication Systems

    Get PDF
    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

    Complete Issue 18, 1998

    Get PDF

    Information in the Context of Philosophy and Cognitive Sciences

    Get PDF
    This textbook briefly maps as many as possible areas and contexts in which information plays an important role. It attempts an approach that also seeks to explore areas of research that are not commonly associated, such as informatics, information and library science, information physics, or information ethics. Given that the text is intended especially for students of the Master's Degree in Cognitive Studies, emphasis is placed on a humane, philosophical and interdisciplinary approach. It offers rather directions of thought, questions, and contexts than a complete theory developed into mathematical and technical details

    EUROPEAN CONFERENCE ON QUEUEING THEORY 2016

    Get PDF
    International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"

    Economics of Spectrum Allocation in Cognitive Radio Networks

    Get PDF
    Cognitive radio networks (CRNs) are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two levels of networks on each channel, primary and secondary, and secondary users can use the channel whenever the primary is not using it. Spectrum allocation in CRNs poses several challenges not present in traditional wireless networks; the goal of this dissertation is to address some of the economic aspects thereof. Broadly, spectrum allocation in CRNs can be done in two ways- (i) one-step allocation in which the spectrum regulator simultaneously allocates spectrum to primary and secondary users in a single allocation and (ii) two-step allocation in which the spectrum regulator first allocates spectrum to primary users, who in turn, allocate unused portions on their channels to secondary users. For the two-step allocation scheme, we consider a spectrum market in which trading of bandwidth among primaries and secondaries is done. When the number of primaries and secondaries is small, we analyze price competition among the primaries using the framework of game theory and seek to find Nash equilibria. We analyze the cases both when all the players are located in a single small location and when they are spread over a large region and spatial reuse of spectrum is done. When the number of primaries and secondaries is large, we consider different types of spectrum contracts derived from raw spectrum and analyze the problem of optimal dynamic selection of a portfolio of long-term and short-term contracts to sell or buy from the points of view of primary and secondary users. For the one-step allocation scheme, we design an auction framework using which the spectrum regulator can simultaneously allocate spectrum to primary and secondary users with the objective of either maximizing its own revenue or maximizing the social welfare. We design different bidding languages, which the users can use to compactly express their bids in the auction, and polynomial-time algorithms for choosing the allocation of channels to the bidders

    Markov and Semi-markov Chains, Processes, Systems and Emerging Related Fields

    Get PDF
    This book covers a broad range of research results in the field of Markov and Semi-Markov chains, processes, systems and related emerging fields. The authors of the included research papers are well-known researchers in their field. The book presents the state-of-the-art and ideas for further research for theorists in the fields. Nonetheless, it also provides straightforwardly applicable results for diverse areas of practitioners

    Artificial intelligence as an enabler for entrepreneurs: a systematic literature review and an agenda for future research

    Get PDF
    Purpose While the disruptive potential of artificial intelligence (AI) has been receiving growing consensus with regards to its positive influence on entrepreneurship, there is a clear lack of systematization in academic literature pertaining to this correlation. The current research seeks to explore the impact of AI on entrepreneurship as an enabler for entrepreneurs, taking into account the crucial application of AI within all Industry 4.0 technological paradigms, such as smart factory, the Internet of things (IoT), augmented reality (AR) and blockchain. Design/methodology/approach A systematic literature review was used to analyze all relevant studies forging connections between AI and entrepreneurship. The cluster interpretation follows a structure that we called the "AI-enabled entrepreneurial process." Findings This study proves that AI has profound implications when it comes to entrepreneurship and, in particular, positively impacts entrepreneurs in four ways: through opportunity, decision-making, performance, and education and research. Practical implications The framework's practical value is linked to its applications for researchers, entrepreneurs and aspiring entrepreneurs (as well as those acting entrepreneurially within established organizations) who want to unleash the power of AI in an entrepreneurial setting. Originality/value This research offers a model through which to interpret the impact of AI on entrepreneurship, systematizing disconnected studies on the topic and arranging contributions into paradigms of entrepreneurial and managerial literature
    • …
    corecore