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

Sheng-kun Chan - One of the best experts on this subject based on the ideXlab platform.

  • Dynamic Routing with Security Considerations
    IEEE Transactions on Parallel and Distributed Systems, 2009
    Co-Authors: Chin Fu Kuo, Ai Chun Pang, Sheng-kun Chan
    Abstract:

    Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we aim at the proposing of a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing Protocols, such as routing information Protocol in wired networks and destination-sequenced Distance Vector Protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

A. R Mahajan - One of the best experts on this subject based on the ideXlab platform.

  • A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks
    Wireless Networks, 2017
    Co-Authors: Gautam M. Borkar, A. R Mahajan
    Abstract:

    A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path Distance Vector Protocol is extended as the base routing Protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification Protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing Protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.

Ralf Steinmetz - One of the best experts on this subject based on the ideXlab platform.

  • The Ad Hoc on-demand Distance Vector Protocol: An analytical model of the route acquisition process
    Lecture Notes in Computer Science, 2004
    Co-Authors: Matthias Hollick, Jens B. Schmitt, Christian Seipl, Ralf Steinmetz
    Abstract:

    Ad hoc networking research suffers from the lack of meaningful and realistic models to describe the route acquisition process of ad hoc routing Protocols. There is a strong need for such models to be able to perform realistic calculations supporting important yet difficult tasks, such as performance estimation and Protocol scalability analysis. Based on existing work for ideal source routing we formulate and validate an analytical model to match the route acquisition process executed by the Ad Hoc On-Demand Distance Vector (AODV) Protocol. This allows us to predict the probability density function of estimated route lengths, a powerful metric for characterization of the network behavior. We further extend our study to include multiple refinements to the basic AODV Protocol. The instantiation and validation of the model is completed by means of an experimental analysis.

  • WWIC - The ad hoc on-demand Distance Vector Protocol : an analytical model of the route acquisition process
    Lecture Notes in Computer Science, 2004
    Co-Authors: Matthias Hollick, Jens B. Schmitt, Christian Seipl, Ralf Steinmetz
    Abstract:

    Ad hoc networking research suffers from the lack of meaningful and realistic models to describe the route acquisition process of ad hoc routing Protocols. There is a strong need for such models to be able to perform realistic calculations supporting important yet difficult tasks, such as performance estimation and Protocol scalability analysis. Based on existing work for ideal source routing we formulate and validate an analytical model to match the route acquisition process executed by the Ad Hoc On-Demand Distance Vector (AODV) Protocol. This allows us to predict the probability density function of estimated route lengths, a powerful metric for characterization of the network behavior. We further extend our study to include multiple refinements to the basic AODV Protocol. The instantiation and validation of the model is completed by means of an experimental analysis.

Chin Fu Kuo - One of the best experts on this subject based on the ideXlab platform.

  • Dynamic Routing with Security Considerations
    IEEE Transactions on Parallel and Distributed Systems, 2009
    Co-Authors: Chin Fu Kuo, Ai Chun Pang, Sheng-kun Chan
    Abstract:

    Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we aim at the proposing of a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing Protocols, such as routing information Protocol in wired networks and destination-sequenced Distance Vector Protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

Karim Djouani - One of the best experts on this subject based on the ideXlab platform.

  • on using multiple quality link metrics with destination sequenced Distance Vector Protocol for wireless multi hop networks
    Canadian Conference on Electrical and Computer Engineering, 2012
    Co-Authors: Nadeem Javaid, A Bibi, Zahoor Ali Khan, Karim Djouani
    Abstract:

    In this paper, we compare and analyze performance of five quality link metrics for Wireless Multi-hop Networks (WMhNs). The metrics are based on loss probability measurements; ETX, ETT, InvETX, ML and MD, in a Distance Vector routing Protocol; DSDV. Among these selected metrics, we have implemented ML, MD, InvETX and ETT in DSDV which are previously implemented with different Protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we deduce that InvETX due to low computational burden and link asymmetry measurement outperforms among all metrics.

  • CCECE - On using multiple quality link metrics with Destination Sequenced Distance Vector Protocol for Wireless Multi-hop Networks
    2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), 2012
    Co-Authors: Nadeem Javaid, A Bibi, Zahoor Ali Khan, Karim Djouani
    Abstract:

    In this paper, we compare and analyze performance of five quality link metrics for Wireless Multi-hop Networks (WMhNs). The metrics are based on loss probability measurements; ETX, ETT, InvETX, ML and MD, in a Distance Vector routing Protocol; DSDV. Among these selected metrics, we have implemented ML, MD, InvETX and ETT in DSDV which are previously implemented with different Protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing Load (NRL) and End-to-End Delay (E2ED) as performance parameters. Finally, we deduce that InvETX due to low computational burden and link asymmetry measurement outperforms among all metrics.