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

Dongmei Zhao - One of the best experts on this subject based on the ideXlab platform.

  • MPBC: A Mobility Prediction-Based Clustering Scheme for Ad Hoc Networks
    IEEE Transactions on Vehicular Technology, 2011
    Co-Authors: Minming Ni, Zhangdui Zhong, Dongmei Zhao
    Abstract:

    Creating a hierarchical structure by Clustering has been considered an effective method to improve the performance of ad hoc networks, such as scalability and stability. This is particularly important for networks with mobile nodes, where the mobility can cause randomly and dynamically changed network topology. In this paper, we propose a mobility prediction-based Clustering (MPBC) Scheme for ad hoc networks with high mobility nodes, where a node may change the associated cluster head (CH) several times during the lifetime of its connection. The proposed Clustering Scheme includes an initial Clustering stage and a cluster maintaining stage. The Doppler shifts associated with periodically exchanged Hello packets between neighboring nodes are used to estimate their relative speeds, and the estimation results are utilized as the basic information in MPBC. In the initial Clustering stage, the nodes having the smallest relative mobility in their neighborhoods are selected as the CHs. In the cluster maintaining stage, mobility prediction strategies are introduced to handle the various problems caused by node movements, such as possible association losses to current CHs and CH role changes, for extending the connection lifetime and providing more stable clusters. An analytical model is developed to find the upper and lower bounds of the average connection lifetime and to find the average association change rate of MPBC. Numerical results verify the analysis and further show that the proposed Clustering Scheme outperforms the existing Clustering Schemes in ad hoc networks with high mobility nodes.

  • An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

  • VTC Spring - An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

Minming Ni - One of the best experts on this subject based on the ideXlab platform.

  • MPBC: A Mobility Prediction-Based Clustering Scheme for Ad Hoc Networks
    IEEE Transactions on Vehicular Technology, 2011
    Co-Authors: Minming Ni, Zhangdui Zhong, Dongmei Zhao
    Abstract:

    Creating a hierarchical structure by Clustering has been considered an effective method to improve the performance of ad hoc networks, such as scalability and stability. This is particularly important for networks with mobile nodes, where the mobility can cause randomly and dynamically changed network topology. In this paper, we propose a mobility prediction-based Clustering (MPBC) Scheme for ad hoc networks with high mobility nodes, where a node may change the associated cluster head (CH) several times during the lifetime of its connection. The proposed Clustering Scheme includes an initial Clustering stage and a cluster maintaining stage. The Doppler shifts associated with periodically exchanged Hello packets between neighboring nodes are used to estimate their relative speeds, and the estimation results are utilized as the basic information in MPBC. In the initial Clustering stage, the nodes having the smallest relative mobility in their neighborhoods are selected as the CHs. In the cluster maintaining stage, mobility prediction strategies are introduced to handle the various problems caused by node movements, such as possible association losses to current CHs and CH role changes, for extending the connection lifetime and providing more stable clusters. An analytical model is developed to find the upper and lower bounds of the average connection lifetime and to find the average association change rate of MPBC. Numerical results verify the analysis and further show that the proposed Clustering Scheme outperforms the existing Clustering Schemes in ad hoc networks with high mobility nodes.

  • An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

  • VTC Spring - An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

Gabriel-miro Muntean - One of the best experts on this subject based on the ideXlab platform.

  • User-Oriented Fuzzy Logic-Based Clustering Scheme for Vehicular Ad-Hoc Networks
    2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013
    Co-Authors: Gabriel-miro Muntean
    Abstract:

    Vehicular ad-hoc networks (VANETs) are considered to have an enormous potential in enhancing road traffic safety and traffic efficiency. Socio-economic challenges, network scalability and stability are identified among the main challenges in VANETs. In response to these challenges, this paper proposes a novel user-oriented Fuzzy Logic-based k-hop distributed Clustering Scheme for VANETs that takes into consideration the vehicle passenger preferences. The novelty element introduced is the employment of Fuzzy Logic as a prominent player in the Clustering Scheme. To the best knowledge of the authors, there are no Fuzzy Logic-based Clustering algorithms designed for VANETs. Simulation-based testing demonstrate how the proposed solution increases the stability of vehicular networks, lifetime and stability of cluster heads compared to both the classic Lowest ID algorithm and an utility function-based Clustering Scheme previously proposed by the same authors.

  • VTC Spring - User-Oriented Fuzzy Logic-Based Clustering Scheme for Vehicular Ad-Hoc Networks
    2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013
    Co-Authors: Gabriel-miro Muntean
    Abstract:

    Vehicular ad-hoc networks (VANETs) are considered to have an enormous potential in enhancing road traffic safety and traffic efficiency. Socio-economic challenges, network scalability and stability are identified among the main challenges in VANETs. In response to these challenges, this paper proposes a novel user-oriented Fuzzy Logic-based k-hop distributed Clustering Scheme for VANETs that takes into consideration the vehicle passenger preferences. The novelty element introduced is the employment of Fuzzy Logic as a prominent player in the Clustering Scheme. To the best knowledge of the authors, there are no Fuzzy Logic-based Clustering algorithms designed for VANETs. Simulation-based testing demonstrate how the proposed solution increases the stability of vehicular networks, lifetime and stability of cluster heads compared to both the classic Lowest ID algorithm and an utility function-based Clustering Scheme previously proposed by the same authors.

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

  • MPBC: A Mobility Prediction-Based Clustering Scheme for Ad Hoc Networks
    IEEE Transactions on Vehicular Technology, 2011
    Co-Authors: Minming Ni, Zhangdui Zhong, Dongmei Zhao
    Abstract:

    Creating a hierarchical structure by Clustering has been considered an effective method to improve the performance of ad hoc networks, such as scalability and stability. This is particularly important for networks with mobile nodes, where the mobility can cause randomly and dynamically changed network topology. In this paper, we propose a mobility prediction-based Clustering (MPBC) Scheme for ad hoc networks with high mobility nodes, where a node may change the associated cluster head (CH) several times during the lifetime of its connection. The proposed Clustering Scheme includes an initial Clustering stage and a cluster maintaining stage. The Doppler shifts associated with periodically exchanged Hello packets between neighboring nodes are used to estimate their relative speeds, and the estimation results are utilized as the basic information in MPBC. In the initial Clustering stage, the nodes having the smallest relative mobility in their neighborhoods are selected as the CHs. In the cluster maintaining stage, mobility prediction strategies are introduced to handle the various problems caused by node movements, such as possible association losses to current CHs and CH role changes, for extending the connection lifetime and providing more stable clusters. An analytical model is developed to find the upper and lower bounds of the average connection lifetime and to find the average association change rate of MPBC. Numerical results verify the analysis and further show that the proposed Clustering Scheme outperforms the existing Clustering Schemes in ad hoc networks with high mobility nodes.

  • An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

  • VTC Spring - An Energy Efficient Clustering Scheme for Mobile Ad Hoc Networks
    2010 IEEE 71st Vehicular Technology Conference, 2010
    Co-Authors: Minming Ni, Zhangdui Zhong, Hao Wu, Dongmei Zhao
    Abstract:

    This paper proposes an Energy Efficient Clustering Scheme for mobile ad hoc networks. In the initial Clustering stage, a node's residual energy, nearby topology, relative location and relative mobility are used for determining whether the node is suitable for being a cluster head. In the cluster maintaining stage, a strategy called Distance Estimation Broadcasting is designed to help a cluster member to estimate the distance between itself and its cluster head. Thus, the cluster members can use less energy to accomplish the data transmission. Moreover, a dynamic calculated Off-Duty Threshold is proposed to trigger the re-Clustering operation when needed. Simulation results show that the proposed Clustering Scheme performs better than the previous Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm.

Iwao Sasase - One of the best experts on this subject based on the ideXlab platform.

  • A stable Clustering Scheme by prediction of the staying time in a cluster for mobile Ad hoc networks
    2008 14th Asia-Pacific Conference on Communications, 2008
    Co-Authors: Yuji Kawai, Iwao Sasase
    Abstract:

    We propose a new Clustering Scheme for mobile ad hoc networks (MANETs), which can maintain a stable Clustering structure by predicting the staying time for a cluster and selecting an optimal clusterhead (CH) which a node affiliates with. In the proposed Scheme, when there are multiple CHs in the nodepsilas one hop neighbors at the initial Clustering set-up or the nodepsilas movement to the outside of the transmission range of its CH, each node predicts the time when it would stay in the transmission range of a CH by using past position information of itself and the CH, and selects the CH with the maximum predicted staying time within neighbor CHs, and affiliates with the CH. Therefore, each node can stay in the same cluster for a long time. In addition, the proposed Clustering Scheme normalizes the system parameters which are used in the weight value calculation. The simulation results show that the proposed Clustering Scheme can reduce the average numbers of reaffiliations and control overheads compared with distributed weighted Clustering algorithm (DWCA).