The Experts below are selected from a list of 7197 Experts worldwide ranked by ideXlab platform

Dongmin Choi - One of the best experts on this subject based on the ideXlab platform.

  • HICSS - Vertex-Based Multihop Vehicle-to-Infrastructure Routing for Vehicular Ad Hoc Networks
    2010 43rd Hawaii International Conference on System Sciences, 2010
    Co-Authors: Raj K. Shrestha, Ilyong Chung, Dongmin Choi
    Abstract:

    Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In this paper, we propose a multihop vehicle-to-Infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to Fixed Infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the Fixed Infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

  • Vertex-Based Multihop Vehicle-to-Infrastructure Routing for Vehicular Ad Hoc Networks
    2010 43rd Hawaii International Conference on System Sciences, 2010
    Co-Authors: Raj K. Shrestha, Ilyong Chung, Dongmin Choi
    Abstract:

    Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In this paper, we propose a multihop vehicle-to-Infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to Fixed Infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the Fixed Infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

Torsten Braun - One of the best experts on this subject based on the ideXlab platform.

  • LCN - Content discovery in wireless information-centric networks
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Carlos Anastasiades, Arun Sittampalam, Torsten Braun
    Abstract:

    Information-centric networking (ICN) enables communication in isolated islands, where Fixed Infrastructure is not available, but also supports seamless communication if the Infrastructure is up and running again. In disaster scenarios, when a Fixed Infrastructure is broken, content discovery algorithms are required to learn what content is locally available. For example, if preferred content is not available, users may also be satisfied with second best options. In this paper, we describe a new content discovery algorithm and compare it to existing Depth-first and Breadth-first traversal algorithms. Evaluations in mobile scenarios with up to 100 nodes show that it results in better performance, i.e., faster discovery time and smaller traffic overhead, than existing algorithms.

  • Content discovery in wireless information-centric networks
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Carlos Anastasiades, Arun Sittampalam, Torsten Braun
    Abstract:

    Information-centric networking (ICN) enables communication in isolated islands, where Fixed Infrastructure is not available, but also supports seamless communication if the Infrastructure is up and running again. In disaster scenarios, when a Fixed Infrastructure is broken, content discovery algorithms are required to learn what content is locally available. For example, if preferred content is not available, users may also be satisfied with second best options. In this paper, we describe a new content discovery algorithm and compare it to existing Depth-first and Breadth-first traversal algorithms. Evaluations in mobile scenarios with up to 100 nodes show that it results in better performance, i.e., faster discovery time and smaller traffic overhead, than existing algorithms.

Raj K. Shrestha - One of the best experts on this subject based on the ideXlab platform.

  • HICSS - Vertex-Based Multihop Vehicle-to-Infrastructure Routing for Vehicular Ad Hoc Networks
    2010 43rd Hawaii International Conference on System Sciences, 2010
    Co-Authors: Raj K. Shrestha, Ilyong Chung, Dongmin Choi
    Abstract:

    Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In this paper, we propose a multihop vehicle-to-Infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to Fixed Infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the Fixed Infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

  • Vertex-Based Multihop Vehicle-to-Infrastructure Routing for Vehicular Ad Hoc Networks
    2010 43rd Hawaii International Conference on System Sciences, 2010
    Co-Authors: Raj K. Shrestha, Ilyong Chung, Dongmin Choi
    Abstract:

    Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In this paper, we propose a multihop vehicle-to-Infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to Fixed Infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the Fixed Infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.

P. Padmanabhan - One of the best experts on this subject based on the ideXlab platform.

  • PETRANET: a Power Efficient Transaction Management Technique for Real-Time Mobile Ad-hoc Network Databases
    22nd International Conference on Data Engineering (ICDE'06), 2006
    Co-Authors: L. Gruenwald, P. Bernedo, P. Padmanabhan
    Abstract:

    A Mobile Ad-Hoc Network (MANET) is a collection of wireless autonomous mobile nodes with no Fixed Infrastructure. Since no Fixed Infrastructure is required, MANET fits well in military operations, emergency disaster rescue, and mobile ad-hoc voting. There are many issues that have to be addressed while designing a technique for managing real-time database transactions in MANET: 1) energy limitations; 2) client and server mobility; 3) real-time constraints imposed on transactions; and 4) frequent disconnection and network partitioning. We have designed PETRANET1: a Power-Efficient Transaction management technique for Real-time mobile Ad-hoc NETwork databases that addresses the above specified issues. In this paper, we present a system prototype that we have developed to implement PETRANET for a military database application.

  • ICDE - PETRANET: a Power Efficient Transaction Management Technique for Real-Time Mobile Ad-hoc Network Databases
    22nd International Conference on Data Engineering (ICDE'06), 2006
    Co-Authors: L. Gruenwald, P. Bernedo, P. Padmanabhan
    Abstract:

    A Mobile Ad-Hoc Network (MANET) is a collection of wireless autonomous mobile nodes with no Fixed Infrastructure. Since no Fixed Infrastructure is required, MANET fits well in military operations, emergency disaster rescue, and mobile ad-hoc voting. There are many issues that have to be addressed while designing a technique for managing real-time database transactions in MANET: 1) energy limitations; 2) client and server mobility; 3) real-time constraints imposed on transactions; and 4) frequent disconnection and network partitioning. We have designed PETRANET1: a Power-Efficient Transaction management technique for Real-time mobile Ad-hoc NETwork databases that addresses the above specified issues. In this paper, we present a system prototype that we have developed to implement PETRANET for a military database application.

Carlos Anastasiades - One of the best experts on this subject based on the ideXlab platform.

  • LCN - Content discovery in wireless information-centric networks
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Carlos Anastasiades, Arun Sittampalam, Torsten Braun
    Abstract:

    Information-centric networking (ICN) enables communication in isolated islands, where Fixed Infrastructure is not available, but also supports seamless communication if the Infrastructure is up and running again. In disaster scenarios, when a Fixed Infrastructure is broken, content discovery algorithms are required to learn what content is locally available. For example, if preferred content is not available, users may also be satisfied with second best options. In this paper, we describe a new content discovery algorithm and compare it to existing Depth-first and Breadth-first traversal algorithms. Evaluations in mobile scenarios with up to 100 nodes show that it results in better performance, i.e., faster discovery time and smaller traffic overhead, than existing algorithms.

  • Content discovery in wireless information-centric networks
    2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
    Co-Authors: Carlos Anastasiades, Arun Sittampalam, Torsten Braun
    Abstract:

    Information-centric networking (ICN) enables communication in isolated islands, where Fixed Infrastructure is not available, but also supports seamless communication if the Infrastructure is up and running again. In disaster scenarios, when a Fixed Infrastructure is broken, content discovery algorithms are required to learn what content is locally available. For example, if preferred content is not available, users may also be satisfied with second best options. In this paper, we describe a new content discovery algorithm and compare it to existing Depth-first and Breadth-first traversal algorithms. Evaluations in mobile scenarios with up to 100 nodes show that it results in better performance, i.e., faster discovery time and smaller traffic overhead, than existing algorithms.