3,394 research outputs found

    A Limited-Global Fault Information Model for Fault Tolerant Routing in Dual-Cube

    Get PDF

    On Constructing the Minimum Orthogonal Convex Polygon in 2-D Faulty Meshes

    Get PDF

    A Limited-Global Fault Information Model for Dynamic Routing in n-D Meshes

    Get PDF

    On Achieving the Shortest-Path Routing in 2-D Meshes

    Get PDF

    GUI: GPS-Less Traffic Congestion Avoidance in Urban Areas with Inter-Vehicular Communication

    Get PDF
    Abstract—Driving in an urban canyon can be frustrating when your GPS teller keeps telling you to make a turn at the place that you just passed, because the information transmission is deferred by the wireless signal reflecting off of buildings and other interfering objects. In this paper, we provide a practical solution for turn-to-turn guidance with inter-vehicle communication in vehicle ad-hoc networks (VANETs). Vehicles collect information from neighbors and catch the snapshot to describe the global impact of traffic congestions, in the presence of unpredictable changes of topology and vehicle trajectory. Without any central-ized control, the information can be aggregated along the traffic flow and be disseminated in a minimal area, while sufficiently guiding each vehicle to achieve a global optimization on its path, and to remain on a non-blocked route. The information constitution is implemented in the proactive model, saving the delay of reconstruction in the reactive model (on-demand). Its substantial improvement on the elapsed time will be shown in the experimental results, compared with the best results known to date in both proactive and reactive information models. Keywords—Information model, inter-vehicular wireless commu-nication, traffic congestion, vehicular ad-hoc network (VANET). I

    A Metric for Routing in Delay-Sensitive Wireless Sensor Networks

    Get PDF

    Quick Convergence Mobility Control Schemes in Wireless Sensor Networks

    Get PDF

    A Joint Replication-Migration-based Routing in Delay Tolerant Networks

    Get PDF
    Abstract—Delay tolerant networks (DTNs) use mobility-assisted routing, where nodes carry, store, and forward data to each other in order to overcome the intermittent connectivity and limited network capacity of this type of network. In this paper, we propose a routing protocol that includes two mechanisms: message replication and message migration. Each mechanism has two steps: message selection and node selection. In message repli-cation, we choose the smallest hop-count message to replicate. The hop-count threshold is used to control the replication speed. We propose a metric called 2-hop activity level to measure the relay node’s transmission capacity, which is used in node selection. Our protocol includes a novel message migration policy that is used to overcome the limited buffer space and bandwidth of DTN nodes. We validate our protocol via extensive simulation experiments; we use a combination of synthetic and real mobility traces. Index Terms—Buffer management, delay tolerant networks (DTNs), message migration, message replication, routing. I
    • …
    corecore