37 research outputs found

    Comparison of Two Self-organization and Hierarchical Routing Protocols for Ad Hoc Networks

    Get PDF
    International audienceIn this article, we compare two self-organization and hierarchical routing protocols for ad hoc networks. These two protocols apply the reverse approach from the classical one, since they use a reactive routing protocol inside the clusters and a proactive routing protocol between the clusters. We compare them regarding the cluster organization they provide and the routing that is then performed over it. This study gives an idea of the impact of the use of recursiveness and of the partition of the DHT on self-organization and hierarchical routing in ad hoc networks

    FLEXCRAN: Cloud radio access network prototype using OpenAirInterface

    Get PDF
    In this demo, we describe the realization of cloud radio access network (C-RAN) prototype using OpenAirInterface (OAI) software and commodity hardware. The deployment of the centralized baseband processing on the remote cloud center (RCC), and the remote radio units (RRU), connected over Ethernet fronthaul is demonstrated. Further, the demo illustrates the flexibility in deploying several cellular radio access network protocol split architectures using OAI

    Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

    Get PDF
    Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV

    Cellular Basis of Allograft Rejection

    No full text
    corecore