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

Kamenyi Domenic - One of the best experts on this subject based on the ideXlab platform.

  • vanet cluster on demand minimum spanning tree mst Prim clustering Algorithm
    2013 International Conference on Computational Problem-solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-onDemand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm’s ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra’s Algorithm which is one of the best clustering Algorithms. Keywords-Dijkstra’s Algorithm, Minimum spanning tree (MST), Prim Algorithm, Vehicular ad hoc networks (VANETs)

  • VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering Algorithm
    2013 International Conference on Computational Problem-Solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm's ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra's Algorithm which is one of the best clustering Algorithms.

Jerry John Kponyo - One of the best experts on this subject based on the ideXlab platform.

  • vanet cluster on demand minimum spanning tree mst Prim clustering Algorithm
    2013 International Conference on Computational Problem-solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-onDemand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm’s ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra’s Algorithm which is one of the best clustering Algorithms. Keywords-Dijkstra’s Algorithm, Minimum spanning tree (MST), Prim Algorithm, Vehicular ad hoc networks (VANETs)

  • VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering Algorithm
    2013 International Conference on Computational Problem-Solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm's ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra's Algorithm which is one of the best clustering Algorithms.

Yuanjie Chen - One of the best experts on this subject based on the ideXlab platform.

  • Implement of patrolling path planning method for power inspection on android platform
    2017 12th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2017
    Co-Authors: Zhichuan Hu, Yan Cheng, Hong Cheng, Zhiyong Chen, Yuanjie Chen
    Abstract:

    In view of the need of emergency inspection and temporary inspection for the transmission and distribution lines, the inspectors are required to quickly reach all inspection points. This paper combines Baidu map open platform with Android system, using the improved Prim Algorithm to propose an intelligent inspection scheme for transmission and distribution lines, which can achieve multi-point patrol path planning of power inspection on Android platform. This scheme overcomes the defects that the mainstream map applications can not scientifically carry on the multi-point path planning, combined with the need of power inspection, making the inspection program more intelligent, handling the multi-point path planning conveniently, and improving the emergency response capability of power inspection departments.

Yujun Kuang - One of the best experts on this subject based on the ideXlab platform.

  • vanet cluster on demand minimum spanning tree mst Prim clustering Algorithm
    2013 International Conference on Computational Problem-solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-onDemand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm’s ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra’s Algorithm which is one of the best clustering Algorithms. Keywords-Dijkstra’s Algorithm, Minimum spanning tree (MST), Prim Algorithm, Vehicular ad hoc networks (VANETs)

  • VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering Algorithm
    2013 International Conference on Computational Problem-Solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm's ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra's Algorithm which is one of the best clustering Algorithms.

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

  • vanet cluster on demand minimum spanning tree mst Prim clustering Algorithm
    2013 International Conference on Computational Problem-solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-onDemand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm’s ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra’s Algorithm which is one of the best clustering Algorithms. Keywords-Dijkstra’s Algorithm, Minimum spanning tree (MST), Prim Algorithm, Vehicular ad hoc networks (VANETs)

  • VANET Cluster-on-Demand Minimum Spanning Tree (MST) Prim clustering Algorithm
    2013 International Conference on Computational Problem-Solving (ICCP), 2013
    Co-Authors: Jerry John Kponyo, Yujun Kuang, Enzhan Zhang, Kamenyi Domenic
    Abstract:

    Vehicle to Vehicle (V2V) communication offers great potential as far as information dissemination in VANETs is concerned. Research has shown that clustering vehicles and relaying information through cluster-heads (CHs) has several advantages over allowing all the vehicles to broadcast the information. Forming and maintaining stable clusters as well as ensuring good QoS in intra-cluster communications has always been a great challenge. In this paper we present a VANET Cluster-on-Demand (CoD) Minimum Spanning Tree (MST) Prim Algorithm which clusters vehicles taking into consideration the intra-cluster QoS. Matlab simulation results of the Algorithm applied to real traffic data has shown the Algorithm's ability to successfully form clusters with good QoS. The Algorithm has also been shown to compare very well with Dijkstra's Algorithm which is one of the best clustering Algorithms.