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

Yang Wenzhong - One of the best experts on this subject based on the ideXlab platform.

  • trust based Minimum Cost opportunistic Routing for ad hoc networks
    Journal of Systems and Software, 2011
    Co-Authors: Huang Chuanhe, Li Layuan, Yang Wenzhong
    Abstract:

    Recently, opportunistic Routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic Routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors' forwarding behavior and apply this model to opportunistic Routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted Minimum Cost Routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and Cost of Routing.

Liu Zhong Kan - One of the best experts on this subject based on the ideXlab platform.

  • A Delay Constraint Minimum Cost Routing Algorithm for Mobile Satellite Networks
    2005 5th International Conference on Information Communications & Signal Processing, 1
    Co-Authors: Zhang Tao, Zhang Jun, Liu Zhong Kan
    Abstract:

    Mobile satellite networks can augment terrestrial wireless networks to provide global services to users regardless of their location. However, traffic on inter-satellite links changes with the satellite's mobility and the communication, especial quality of service (QoS) guarantee, becomes difficultly, since the change may cause violation of QoS requirements of on-going calls. In this paper, by exploiting the predictive nature of the mobile satellite topology, a novel satellite networks delay constraint Minimum Cost Routing (SDCMCR) algorithm, which can obtain a path to satisfy the delay constraint as well as the minimization of influence caused by the handover, is proposed. This algorithm gives attention to the network performances both of service interrupting and blocking. Moreover it has a low computing complexity. Correlative simulation indicates that this novel algorithm is superior to other current algorithm in respect of computing complexity and service blocking probability etc

Huang Chuanhe - One of the best experts on this subject based on the ideXlab platform.

  • trust based Minimum Cost opportunistic Routing for ad hoc networks
    Journal of Systems and Software, 2011
    Co-Authors: Huang Chuanhe, Li Layuan, Yang Wenzhong
    Abstract:

    Recently, opportunistic Routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic Routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors' forwarding behavior and apply this model to opportunistic Routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted Minimum Cost Routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and Cost of Routing.

Zhang Tao - One of the best experts on this subject based on the ideXlab platform.

  • A Delay Constraint Minimum Cost Routing Algorithm for Mobile Satellite Networks
    2005 5th International Conference on Information Communications & Signal Processing, 1
    Co-Authors: Zhang Tao, Zhang Jun, Liu Zhong Kan
    Abstract:

    Mobile satellite networks can augment terrestrial wireless networks to provide global services to users regardless of their location. However, traffic on inter-satellite links changes with the satellite's mobility and the communication, especial quality of service (QoS) guarantee, becomes difficultly, since the change may cause violation of QoS requirements of on-going calls. In this paper, by exploiting the predictive nature of the mobile satellite topology, a novel satellite networks delay constraint Minimum Cost Routing (SDCMCR) algorithm, which can obtain a path to satisfy the delay constraint as well as the minimization of influence caused by the handover, is proposed. This algorithm gives attention to the network performances both of service interrupting and blocking. Moreover it has a low computing complexity. Correlative simulation indicates that this novel algorithm is superior to other current algorithm in respect of computing complexity and service blocking probability etc

Li Layuan - One of the best experts on this subject based on the ideXlab platform.

  • trust based Minimum Cost opportunistic Routing for ad hoc networks
    Journal of Systems and Software, 2011
    Co-Authors: Huang Chuanhe, Li Layuan, Yang Wenzhong
    Abstract:

    Recently, opportunistic Routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic Routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors' forwarding behavior and apply this model to opportunistic Routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted Minimum Cost Routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and Cost of Routing.