2018 IEEE/ACM 22nd International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2018
In recent years, clustering has emerged as a promising approach to facilitate data routing and da... more In recent years, clustering has emerged as a promising approach to facilitate data routing and data aggregation in Wireless Sensor Network (WSN). Although clustering based routing approaches are appropriate for small-scale networks, they do not fit large scale WSNs as it is the case in LEACH [1]. Indeed, clustering suffers from the adverse effects of isolated nodes in the network and some coverage problems. To deal with these issues, we present LEATCH-L, a Low Energy Adaptive Tier Clustering Hierarchy for Large scale WSNs. The proposed approach makes the major functions of LEACH applicable to large-scale WSNs whose dimension is much larger than the largest transmission radius of the sensor nodes. The latter imposes a dynamic decomposable structure on the network topology which results in a set of smaller subnetworks. Such decompositions are implemented through a smart m-level hierarchical clustering process. Moreover, the proposed approach involves a two level data aggregation. Evaluation results show that the introduced approach is scalable with significantly much better performance than the state-of-the art approaches.
2021 International Symposium on Networks, Computers and Communications (ISNCC), 2021
VANET nodes are characterized by their high mobility and they exhibit different mobility patterns... more VANET nodes are characterized by their high mobility and they exhibit different mobility patterns. Therefore, VANET clustering schemes should take into consideration the mobility parameters among neighboring nodes to produce relatively stable clustering structure. This paper proposes a novel cluster head selection Fuzzy Logic-based k-hop distributed clustering scheme for VANETs. This scheme considers the safe inter-distance between vehicles as one of important metrics for cluster head selection. Our contribution deals better with the scalability and stability issues of VANETs and can achieve a high stable cluster topology compared to other schemes. These features make the proposed scheme more suitable for VANETs networks. Simulation proves the effectiveness of the new proposed scheme to create stable clusters by reducing re-clustering overhead and prolonging cluster lifetime compared to other existing clustering schemes for VANET.
Semantic Web Science and Real-World Applications, 2019
Although recursive localization approaches are efficiently used in wireless sensor networks (WSNs... more Although recursive localization approaches are efficiently used in wireless sensor networks (WSNs), their application leads to increased energy consumption caused by the important communication overhead necessary to achieve the localization task. Indeed, localization information coverage increases iteratively as new nodes estimate their locations and become themselves new reference nodes. However, the uncontrollable number evolution of such nodes leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy due the adverse effects of error propagation and accumulation. This chapter proposes an efficient recursive localization (ERL) approach that develops a new reliable reference selection strategy to ensure a better distribution of the reference nodes in the network. ERL improves localization accuracy without incurring any additional cost. It allows conserving the energy and consequently prolonging the WSN l...
2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), 2017
To obtain a trade-off between location accuracy and implementation cost, recursive localization s... more To obtain a trade-off between location accuracy and implementation cost, recursive localization schemes are being pursued as a cost-effective alternative to more expensive localization approaches, where localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in large scale networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, we propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the localization accuracy through an adequate distribution of reference nodes within the network.
2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA), 2017
Although recursive localization approaches stand well in small-scale networks, they are unsuitabl... more Although recursive localization approaches stand well in small-scale networks, they are unsuitable for largescale WSNs. Indeed, they suffer from the adverse effects of error propagation and accumulation. They also require an important communication overhead related to the localization data broadcasted by new reference nodes. To deal with these issues, we developed a new reliable reference selection strategy that ensures a better distribution of these nodes. Our approach couples the novel selection strategy with a refinement phase that enhances the position accuracy. Simulations show that our approach consistently reduces the position error, while it requires less communication overhead. Moreover, it conserves the energy, which helps enhance the WSN lifetime
This work highlights the key factors considered to evaluate the performance of a Localization Sys... more This work highlights the key factors considered to evaluate the performance of a Localization System (LS) for W SNs. Indeed, the majority of the existing works concentrated essentially on the accuracy of the estimated location by the LS and ignored its performance in terms of localization cost, scalability and coverage. To address the accuracy/cost trade-off of a LS for WSNs, this work attempted to redefine and reformulate the Sensor Network Localization Problem (SNLP) as a Multi-Objective Optimization Sensor Network Localization Problem (MOO-SNLP). The latter requires the consideration of multiple objectives, like the position accuracy enhancement, with a reduced energy consumption, communication overhead and deployment cost of a localization approach. Moreover, we highlight the performances of the two most commonly-used localization approaches, Recursive Position Estimation (RPE) and Centroid Localization Algorithm (CLA), using different metrics under simulations. In fact, the obt...
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini ClusterHead (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we ha ve made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using th...
Self-organization and localization capabilities are among the most important requirements in wire... more Self-organization and localization capabilities are among the most important requirements in wireless sensor networks (WSNs). While existing localization approaches mainly focus on enhancing the accuracy and minimizing the position error, particular attention has recently been given to reducing the localization algorithm implementation cost. This work re-explores the theory of wireless sensor network localization problem (SNLP), which is then re-considered as a multi-objective optimization problem (MOO-SNLP), maximizing the localization accuracy while minimizing the localization cost. The paper discusses a set of evaluation criteria and performance metrics in order to highlight the trade-off between location accuracy and implementation cost such as the energy consumption, communication overhead.
2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), 2017
Despite the fact that cooperative localization approaches stand well in Wireless Sensor Networks ... more Despite the fact that cooperative localization approaches stand well in Wireless Sensor Networks (WSNs), they impose challenge of increased energy consumption resulting from the important communication overhead required to accomplish the localization task. In this paper, we developed an Energy Aware Cooperative Localization approach (EACL) based on using a recursive localization system. Obviously, system coverage increases iteratively as nodes with newly-estimated position join the reference set. Our approach implements a novel selection strategy of reference nodes that is beneficial in the sense that: (1) it reduces the adverse effects of error propagation and accumulation, and (2) helps conserve the residual energy of the sensor nodes. Furthermore, we introduced a refinement mechanism to further improve localization accuracy without incurring any additional costs. Simulations showed that our approach consistently reduces the position error. It allows also conserving the energy and...
Transactions on Emerging Telecommunications Technologies, 2020
Vehicular ad hoc network (VANET) nodes are characterized by their high mobility and by exhibiting... more Vehicular ad hoc network (VANET) nodes are characterized by their high mobility and by exhibiting different mobility patterns. Therefore, VANET clustering schemes are required to account for the mobility parameters among neighboring nodes to produce relatively stable clustering schemes. In this article, we propose a novel cluster-head (CH) selection scheme for VANETs. This scheme is based on a fuzzy logic-powered, k-hop distributed clustering algorithm. It deals efficiently with scalability and stability issues of VANETs and is able to achieve highly stable clustering topologies as compared with other schemes. Our proposed clustering scheme strives to maintain a safe intervehicle distance as a one prime metric for CH selection. Moreover, a major contribution of our work is the proposal of a novel strategy for constructing fuzzy logic-based clustering algorithms useful for VANETs. This proposed solution is useful in an Internet of things-based setting that involves controlled vehicle-to-vehicle communication. We first derive mathematically, a new average distance estimation formula that is used as a metric for selecting CHs, leading to safer clusters that avoid collisions with front and rear vehicles. Furthermore, the new proposed scheme creates stable clusters by reducing reclustering overhead and prolonging clusters' lifetimes.
Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transport... more Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transportation and roadside advertisement, make VANETs become an important component of metropolitan area networks. In VANETs, mobile nodes are vehicles which are equipped with wireless antennas; and they can communicate with each other by wireless communication on ad-hoc mode or infrastructure mode. Clustering vehicles into different groups can introduce many advantages for VANETs as it can facilitate resource reuse and increase system capacity. The main contribution of our work is a new strategy for clustering a VANET and improvements in many classical clustering metrics. One of the main ideas is the definition of a new optimized selection metric for the clustering of vehicular nodes, in the framework of Next Generation Vehicular ad-hoc Network. These metrics should select clusterheads which provide safe clusters and avoid collisions with adjacent vehicle nodes and intend to create stable clusters by reducing reclustering overhead and prolonging cluster lifetime
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini Cluster-Head (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we have made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using the probabilistic model to manage the energy consumption in WSNs. Simulation results show that LEATCH performs better than LEACH in term of energy, delay, coverage and scalability.
International Journal on Semantic Web and Information Systems, 2017
While existing localization approaches mainly focus on enhancing the accuracy, particular attenti... more While existing localization approaches mainly focus on enhancing the accuracy, particular attention has recently been given to reducing the localization algorithm implementation costs. To obtain a tradeoff between location accuracy and implementation cost, recursive localization approaches are being pursued as a cost-effective alternative to the more expensive localization approaches. In the recursive approach, localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, the authors propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the l...
Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transport... more Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transportation and roadside advertisement, make VANETs become an important component of metropolitan area networks. In VANETs, mobile nodes are vehicles which are equipped with wireless antennas; and they can communicate with each other by wireless communication on ad-hoc mode or infrastructure mode. Clustering vehicles into different groups can introduce many advantages for VANETs as it can facilitate resource reuse and increase system capacity. The main contribution of our work is a new strategy for clustering a VANET and improvements in many classical clustering metrics. One of the main ideas is the definition of a new optimized selection metric for the clustering of vehicular nodes, in the framework of Next Generation Vehicular ad-hoc Network. These metrics should select clusterheads which provide safe clusters and avoid collisions with adjacent vehicle nodes and intend to create stable clusters by reducing reclustering overhead and prolonging cluster lifetime
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini Cluster- Head (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we have made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using the probabilistic model to manage the energy consumption in WSNs. Simulation results show that LEATCH performs better than LEACH in term of energy, delay, coverage and scalability.
2018 IEEE/ACM 22nd International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2018
In recent years, clustering has emerged as a promising approach to facilitate data routing and da... more In recent years, clustering has emerged as a promising approach to facilitate data routing and data aggregation in Wireless Sensor Network (WSN). Although clustering based routing approaches are appropriate for small-scale networks, they do not fit large scale WSNs as it is the case in LEACH [1]. Indeed, clustering suffers from the adverse effects of isolated nodes in the network and some coverage problems. To deal with these issues, we present LEATCH-L, a Low Energy Adaptive Tier Clustering Hierarchy for Large scale WSNs. The proposed approach makes the major functions of LEACH applicable to large-scale WSNs whose dimension is much larger than the largest transmission radius of the sensor nodes. The latter imposes a dynamic decomposable structure on the network topology which results in a set of smaller subnetworks. Such decompositions are implemented through a smart m-level hierarchical clustering process. Moreover, the proposed approach involves a two level data aggregation. Evaluation results show that the introduced approach is scalable with significantly much better performance than the state-of-the art approaches.
2021 International Symposium on Networks, Computers and Communications (ISNCC), 2021
VANET nodes are characterized by their high mobility and they exhibit different mobility patterns... more VANET nodes are characterized by their high mobility and they exhibit different mobility patterns. Therefore, VANET clustering schemes should take into consideration the mobility parameters among neighboring nodes to produce relatively stable clustering structure. This paper proposes a novel cluster head selection Fuzzy Logic-based k-hop distributed clustering scheme for VANETs. This scheme considers the safe inter-distance between vehicles as one of important metrics for cluster head selection. Our contribution deals better with the scalability and stability issues of VANETs and can achieve a high stable cluster topology compared to other schemes. These features make the proposed scheme more suitable for VANETs networks. Simulation proves the effectiveness of the new proposed scheme to create stable clusters by reducing re-clustering overhead and prolonging cluster lifetime compared to other existing clustering schemes for VANET.
Semantic Web Science and Real-World Applications, 2019
Although recursive localization approaches are efficiently used in wireless sensor networks (WSNs... more Although recursive localization approaches are efficiently used in wireless sensor networks (WSNs), their application leads to increased energy consumption caused by the important communication overhead necessary to achieve the localization task. Indeed, localization information coverage increases iteratively as new nodes estimate their locations and become themselves new reference nodes. However, the uncontrollable number evolution of such nodes leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy due the adverse effects of error propagation and accumulation. This chapter proposes an efficient recursive localization (ERL) approach that develops a new reliable reference selection strategy to ensure a better distribution of the reference nodes in the network. ERL improves localization accuracy without incurring any additional cost. It allows conserving the energy and consequently prolonging the WSN l...
2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), 2017
To obtain a trade-off between location accuracy and implementation cost, recursive localization s... more To obtain a trade-off between location accuracy and implementation cost, recursive localization schemes are being pursued as a cost-effective alternative to more expensive localization approaches, where localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in large scale networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, we propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the localization accuracy through an adequate distribution of reference nodes within the network.
2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA), 2017
Although recursive localization approaches stand well in small-scale networks, they are unsuitabl... more Although recursive localization approaches stand well in small-scale networks, they are unsuitable for largescale WSNs. Indeed, they suffer from the adverse effects of error propagation and accumulation. They also require an important communication overhead related to the localization data broadcasted by new reference nodes. To deal with these issues, we developed a new reliable reference selection strategy that ensures a better distribution of these nodes. Our approach couples the novel selection strategy with a refinement phase that enhances the position accuracy. Simulations show that our approach consistently reduces the position error, while it requires less communication overhead. Moreover, it conserves the energy, which helps enhance the WSN lifetime
This work highlights the key factors considered to evaluate the performance of a Localization Sys... more This work highlights the key factors considered to evaluate the performance of a Localization System (LS) for W SNs. Indeed, the majority of the existing works concentrated essentially on the accuracy of the estimated location by the LS and ignored its performance in terms of localization cost, scalability and coverage. To address the accuracy/cost trade-off of a LS for WSNs, this work attempted to redefine and reformulate the Sensor Network Localization Problem (SNLP) as a Multi-Objective Optimization Sensor Network Localization Problem (MOO-SNLP). The latter requires the consideration of multiple objectives, like the position accuracy enhancement, with a reduced energy consumption, communication overhead and deployment cost of a localization approach. Moreover, we highlight the performances of the two most commonly-used localization approaches, Recursive Position Estimation (RPE) and Centroid Localization Algorithm (CLA), using different metrics under simulations. In fact, the obt...
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini ClusterHead (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we ha ve made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using th...
Self-organization and localization capabilities are among the most important requirements in wire... more Self-organization and localization capabilities are among the most important requirements in wireless sensor networks (WSNs). While existing localization approaches mainly focus on enhancing the accuracy and minimizing the position error, particular attention has recently been given to reducing the localization algorithm implementation cost. This work re-explores the theory of wireless sensor network localization problem (SNLP), which is then re-considered as a multi-objective optimization problem (MOO-SNLP), maximizing the localization accuracy while minimizing the localization cost. The paper discusses a set of evaluation criteria and performance metrics in order to highlight the trade-off between location accuracy and implementation cost such as the energy consumption, communication overhead.
2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), 2017
Despite the fact that cooperative localization approaches stand well in Wireless Sensor Networks ... more Despite the fact that cooperative localization approaches stand well in Wireless Sensor Networks (WSNs), they impose challenge of increased energy consumption resulting from the important communication overhead required to accomplish the localization task. In this paper, we developed an Energy Aware Cooperative Localization approach (EACL) based on using a recursive localization system. Obviously, system coverage increases iteratively as nodes with newly-estimated position join the reference set. Our approach implements a novel selection strategy of reference nodes that is beneficial in the sense that: (1) it reduces the adverse effects of error propagation and accumulation, and (2) helps conserve the residual energy of the sensor nodes. Furthermore, we introduced a refinement mechanism to further improve localization accuracy without incurring any additional costs. Simulations showed that our approach consistently reduces the position error. It allows also conserving the energy and...
Transactions on Emerging Telecommunications Technologies, 2020
Vehicular ad hoc network (VANET) nodes are characterized by their high mobility and by exhibiting... more Vehicular ad hoc network (VANET) nodes are characterized by their high mobility and by exhibiting different mobility patterns. Therefore, VANET clustering schemes are required to account for the mobility parameters among neighboring nodes to produce relatively stable clustering schemes. In this article, we propose a novel cluster-head (CH) selection scheme for VANETs. This scheme is based on a fuzzy logic-powered, k-hop distributed clustering algorithm. It deals efficiently with scalability and stability issues of VANETs and is able to achieve highly stable clustering topologies as compared with other schemes. Our proposed clustering scheme strives to maintain a safe intervehicle distance as a one prime metric for CH selection. Moreover, a major contribution of our work is the proposal of a novel strategy for constructing fuzzy logic-based clustering algorithms useful for VANETs. This proposed solution is useful in an Internet of things-based setting that involves controlled vehicle-to-vehicle communication. We first derive mathematically, a new average distance estimation formula that is used as a metric for selecting CHs, leading to safer clusters that avoid collisions with front and rear vehicles. Furthermore, the new proposed scheme creates stable clusters by reducing reclustering overhead and prolonging clusters' lifetimes.
Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transport... more Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transportation and roadside advertisement, make VANETs become an important component of metropolitan area networks. In VANETs, mobile nodes are vehicles which are equipped with wireless antennas; and they can communicate with each other by wireless communication on ad-hoc mode or infrastructure mode. Clustering vehicles into different groups can introduce many advantages for VANETs as it can facilitate resource reuse and increase system capacity. The main contribution of our work is a new strategy for clustering a VANET and improvements in many classical clustering metrics. One of the main ideas is the definition of a new optimized selection metric for the clustering of vehicular nodes, in the framework of Next Generation Vehicular ad-hoc Network. These metrics should select clusterheads which provide safe clusters and avoid collisions with adjacent vehicle nodes and intend to create stable clusters by reducing reclustering overhead and prolonging cluster lifetime
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini Cluster-Head (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we have made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using the probabilistic model to manage the energy consumption in WSNs. Simulation results show that LEATCH performs better than LEACH in term of energy, delay, coverage and scalability.
International Journal on Semantic Web and Information Systems, 2017
While existing localization approaches mainly focus on enhancing the accuracy, particular attenti... more While existing localization approaches mainly focus on enhancing the accuracy, particular attention has recently been given to reducing the localization algorithm implementation costs. To obtain a tradeoff between location accuracy and implementation cost, recursive localization approaches are being pursued as a cost-effective alternative to the more expensive localization approaches. In the recursive approach, localization information increases progressively as new nodes compute their positions and become themselves reference nodes. A strategy is then required to control and maintain the distribution of these new reference nodes. The lack of such a strategy leads, especially in high density networks, to wasted energy, important communication overhead and even impacts the localization accuracy. In this paper, the authors propose an efficient recursive localization approach that reduces the energy consumption, the execution time, and the communication overhead, yet it increases the l...
Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transport... more Many applications introduced by Vehicular Ad-Hoc Networks (VANETs), such as intelligent transportation and roadside advertisement, make VANETs become an important component of metropolitan area networks. In VANETs, mobile nodes are vehicles which are equipped with wireless antennas; and they can communicate with each other by wireless communication on ad-hoc mode or infrastructure mode. Clustering vehicles into different groups can introduce many advantages for VANETs as it can facilitate resource reuse and increase system capacity. The main contribution of our work is a new strategy for clustering a VANET and improvements in many classical clustering metrics. One of the main ideas is the definition of a new optimized selection metric for the clustering of vehicular nodes, in the framework of Next Generation Vehicular ad-hoc Network. These metrics should select clusterheads which provide safe clusters and avoid collisions with adjacent vehicle nodes and intend to create stable clusters by reducing reclustering overhead and prolonging cluster lifetime
In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered... more In Wireless Sensor Networks, low latency, energy efficiency, and coverage problems are considered as three key issues in designing routing protocols. In this paper we present a new protocol called Low Energy Adaptive Tier Clustering Hierarchy (LEATCH), which offers a good compromise between delay and energy consumption and resolves some coverage problems. For our purpose, a two level hierarchical approach has been proposed to organize a sensor network into a set of clusters, every cluster divided into small clusters that are called Mini Clusters. As the way the clusters are organized, for each mini cluster we define a Mini Cluster- Head (MCH). Every MCH communicates with the cluster-head directly, it aggregates its mini-cluster information. In addition, we have made some changes in the procedure of cluster head and mini cluster head election. LEATCH promises better performances than the conventional LEACH protocol which is one of the most known hierarchical routing protocols using the probabilistic model to manage the energy consumption in WSNs. Simulation results show that LEATCH performs better than LEACH in term of energy, delay, coverage and scalability.
Uploads
Papers by badia bouhdid