Survey of Clustering Schemes in Mobile Ad hoc Networks
---
paper_title: Scalable Routing Protocols for Mobile Ad Hoc Networks

paper_content:

The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.
---
paper_title: An Efficient Cluster-Based Routing Algorithm in Ad Hoc Networks with Unidirectional Links *

paper_content:

Mobile ad hoc networks are dynamically organized by a collection of wireless mobile nodes. The mobile nodes in ad hoc networks can move arbitrarily thus the topology of network changes dynamically. Due to the properties of communication medium in wireless networks, unidirectional links may exist between mobile nodes thus results in the difficulty of link utilization and routing. In this paper, we take the advantages of multi-hop acknowledgement and employ the clustering technique to design an efficient hybrid routing protocol in ad hoc networks with unidirectional links. Simulation results demonstrate the stability and efficiency of the proposed protocol.
---
paper_title: Max-min d-cluster formation in wireless ad hoc networks

paper_content:

An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then we present a heuristic to form d-clusters in a wireless ad hoc network. Nodes are assumed to have a non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. When the heuristic terminates, a node either becomes a clusterhead, or is at most d wireless hops away from its clusterhead. The value of d is a parameter of the heuristic. The heuristic can be run either at regular intervals, or whenever the network configuration changes. One of the features of the heuristic is that it tends to re-elect existing clusterheads even when the network configuration changes. This helps to reduce the communication overheads during transition from old clusterheads to new clusterheads. Also, there is a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes. Thus, the heuristic is fair and stable. Simulation experiments demonstrate that the proposed heuristic is better than the two earlier heuristics, namely the LCA and degree-based solutions.
---
paper_title: Issues in scalable clustered network architecture for mobile ad hoc networks

paper_content:

As a large-scale, high-density multi-hop network becomes desirable in many applications, there exists a greater demand for scalable mobile ad hoc network (MANET) architecture. Due to the increased route length between two end nodes in a multi-hop MANET, the challenge is in the limited scalability despite the improved spatial diversity in a large network area. Common to most of existing approaches for a scalable MANET is the link cluster architecture (LCA), where mobile nodes are logically partitioned into groups, called clusters. Clustering algorithms select master nodes and maintain the cluster structure dynamically as nodes move. Routing protocols utilize the underlying cluster structure to maintain routing and location information in an efficient manner. This paper discusses the various issues in scalable clustered network architectures for MANETs. This includes a classification of link-clustered architectures, an overview of clustering algorithms focusing on master selection, and a survey of cluster-based routing protocols.
---
paper_title: A survey of clustering schemes for mobile ad hoc networks

paper_content:

Clustering is an important research topic for mobile ad hoc networks (MANETs) because clustering makes it possible to guarantee basic levels of system performance, such as throughput and delay, in the presence of both mobility and a large number of mobile terminals. A large variety of approaches for ad hoc clustering have been presented, whereby different approaches typically focus on different performance metrics. This article presents a comprehensive survey of recently proposed clustering algorithms, which we classify based on their objectives. This survey provides descriptions of the mechanisms, evaluations of their performance and cost, and discussions of advantages and disadvantages of each clustering scheme. With this article, readers can have a more thorough and delicate understanding of ad hoc clustering and the research trends in this area.
---
paper_title: A survey on clustering algorithms for wireless sensor networks

paper_content:

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
---
paper_title: Survey of clustering algorithms for MANET

paper_content:

Many clustering schemes have been proposed for ad hoc networks. A systematic classification of these clustering schemes enables one to better understand and make improvements. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance. Protocols try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control protocol. The clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. A large variety of approaches for ad hoc clustering have been developed by researchers which focus on different performance metrics. This paper presents a survey of different clustering schemes.
---
paper_title: A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks

paper_content:

Clustering in mobile ad hoc network (MANET) play a vital role in improving its basic network performance parameters like routing delay, bandwidth consumption and throughput. One-hop clustering scheme adopts the simple mechanism to make the logical partition of the dynamic network where the network topology changes constantly resulting an unstable clustering. This paper makes a comprehensive survey of some bench-mark one-hop clustering algorithms to understand the research trends in this area. The literature provides the logic of cluster formation for different algorithms in achieving a linked cluster architecture and an intensive simulation survey of their performance on the cluster maintenance aspects such as cluster density, frequency of cluster reelection, frequency of cluster changes by the nodes and the granularity of cluster heads. This paper should facilitate the researchers as well as practitioners in choosing a suitable clustering algorithm on the basis of their formation and maintenance overhead, before any routing scheme is adopted in the mobile ad hoc network.
---
paper_title: A Distributed Weighted Cluster Based Routing Protocol for MANETs

paper_content:

MANETs or Mobile ad-hoc networks are a form of wireless networks which do not require a base station for providing network connectivity. Mobile ad-hoc networks have many characteristics which distinguish them from other wireless networks which makes routing in mobile ad-hoc networks a challenging task. Cluster based routing scheme is one of the routing schemes for MANETs in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which are responsible for routing between clusters. In this project we have designed an implementation of Distributed Weighted Clustering Algorithm. This approach is based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. After implementation we have evaluated the performance of our cluster based routing scheme in various network situations.
---
paper_title: A design concept for reliable mobile radio networks with frequency hopping signaling

paper_content:

The design of a packet radio network must reflect the operational requirements and environmental constraints to which it is subject. In this paper, we outline those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and we present a design concept for this network that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed network control and frequency hopping spread-spectrum signaling. We demonstrate how the execution of the fully distributed Linked Cluster Algorithm can enable a network to reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code division mutiple access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that exploit CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented in conjunction with the Linked Cluster network structure. The design concept presented in this paper provides a high degree of survivability and flexibility, to accommodate changing environmental conditions and user demands.
---
paper_title: WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

paper_content:

In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as i>ad hoc networks, are dynamic in nature due to the mobility of nodes. The association and dissociation of nodes to and from i>clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The i>clusterheads, form a i>dominant set in the network, determine the topology and its stability. The proposed weight-based distributed clustering algorithm takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes. The time required to identify the clusterheads depends on the diameter of the underlying graph. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. The non-periodic procedure for clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. The clusterheads, operating in “dual" power mode, connects the clusters which help in routing messages from a node to any other node. We observe a trade-off between the uniformity of the load handled by the clusterheads and the connectivity of the network. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, i>reaffiliation frequency, and dominant set updates. Results show that our algorithm performs better than existing ones and is also tunable to different kinds of network conditions.
---
paper_title: Distributed clustering for ad hoc networks

paper_content:

A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network: (ad hoc network) into clusters, this giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterion that allows the choice of the nodes that coordinate the clustering process based on node mobility-rebated parameters. The DCA is suitable for clustering "quasistatic" ad hoc networks. It is easy to implement and its time complexity is proven to be bounded by a network parameter that depends on the topology of the network rather than on its size, i.e., the invariant number of the network nodes. The DMAC algorithm adapts to the changes in the network topology due to the mobility of the nodes, and it is thus suitable for any mobile environment. Both algorithms are executed at each node with the sole knowledge of the identity of the one hop neighbors, and induce on the network the same clustering structure.
---
paper_title: A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks

paper_content:

Clustering has been proven to support quality of services effectively in a multi-hop network. In order to achieve good performance in a mobile ad hoc network whose topology changes dynamically, any clustering algorithm should operate with minimum clustering maintenance overhead and preserve current cluster structure as much as possible. In this paper, we propose a clustering algorithm, namely a distributed weighted clustering algorithm. The goals of the algorithm are maintaining stable clustering structure, minimizing the overhead for the clustering set up and maintenance, maximizing lifespan of mobile nodes in the system, and achieving good end-to-end performance. DWCA chooses locally optimal clusterheads and incorporates power management at the clusterheads. Results obtained from simulations proved that the proposed algorithm achieves the goals.
---
paper_title: A survey of clustering schemes for mobile ad hoc networks

paper_content:

Clustering is an important research topic for mobile ad hoc networks (MANETs) because clustering makes it possible to guarantee basic levels of system performance, such as throughput and delay, in the presence of both mobility and a large number of mobile terminals. A large variety of approaches for ad hoc clustering have been presented, whereby different approaches typically focus on different performance metrics. This article presents a comprehensive survey of recently proposed clustering algorithms, which we classify based on their objectives. This survey provides descriptions of the mechanisms, evaluations of their performance and cost, and discussions of advantages and disadvantages of each clustering scheme. With this article, readers can have a more thorough and delicate understanding of ad hoc clustering and the research trends in this area.
---
paper_title: A survey on clustering algorithms for wireless sensor networks

paper_content:

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
---
paper_title: Survey of clustering algorithms for MANET

paper_content:

Many clustering schemes have been proposed for ad hoc networks. A systematic classification of these clustering schemes enables one to better understand and make improvements. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance. Protocols try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control protocol. The clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. A large variety of approaches for ad hoc clustering have been developed by researchers which focus on different performance metrics. This paper presents a survey of different clustering schemes.
---
paper_title: A design concept for reliable mobile radio networks with frequency hopping signaling

paper_content:

The design of a packet radio network must reflect the operational requirements and environmental constraints to which it is subject. In this paper, we outline those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and we present a design concept for this network that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed network control and frequency hopping spread-spectrum signaling. We demonstrate how the execution of the fully distributed Linked Cluster Algorithm can enable a network to reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code division mutiple access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that exploit CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented in conjunction with the Linked Cluster network structure. The design concept presented in this paper provides a high degree of survivability and flexibility, to accommodate changing environmental conditions and user demands.
---
paper_title: Adaptive Clustering for Mobile Wireless Networks

paper_content:

This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled, and are dynamically reconfigured as the nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Second, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological changes caused by node motion, node failure, and node insertion/removal. Simulation shows that this architecture provides an efficient, stable infrastructure for the integration of different types of traffic in a dynamic radio network.
---
paper_title: Connectivity based k-hop clustering in wireless networks

paper_content:

In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. We propose to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads. The goal is to minimize the number of clusters, which results in dominating sets of smaller sizes (this is important for applications in broadcasting and Bluetooth formation). We also describe algorithms for modifying cluster structure in the presence of topological changes. Next, we generalize the cluster definition so that a cluster contains all nodes that are at a distance of at most k hops from the cluster head. The efficiency of four clustering algorithms (k-lowestID and k-CONID, k=1 and k=2) is tested by measuring the average number of created clusters, the number of border nodes, and the cluster size in random unit graphs. The most interesting experimental result is stability of the ratio of the sum of CHs and border nodes in the set. It was constantly 60-70% for 1-lowestID and 46-56% for 1-ConID, for any value of n (number of nodes) and d (average node degree). Similar conclusions and similar number were obtained for k=2. We also proposed a unified framework for most existing and new clustering algorithms where a properly defined weight at each node is the only difference in the algorithm. Finally, we propose a framework for generating random unit graphs with obstacles.
---
paper_title: Max-min d-cluster formation in wireless ad hoc networks

paper_content:

An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then we present a heuristic to form d-clusters in a wireless ad hoc network. Nodes are assumed to have a non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. When the heuristic terminates, a node either becomes a clusterhead, or is at most d wireless hops away from its clusterhead. The value of d is a parameter of the heuristic. The heuristic can be run either at regular intervals, or whenever the network configuration changes. One of the features of the heuristic is that it tends to re-elect existing clusterheads even when the network configuration changes. This helps to reduce the communication overheads during transition from old clusterheads to new clusterheads. Also, there is a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes. Thus, the heuristic is fair and stable. Simulation experiments demonstrate that the proposed heuristic is better than the two earlier heuristics, namely the LCA and degree-based solutions.
---
paper_title: 3hBAC (3-hop between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks

paper_content:

The clustering protocol of an ad hoc network is always with interest. In this paper, we present a novel non-overlapping clustering algorithm, 3-hop between adjacent clusterheads (3hBAC), which can decrease the number of clusters without loss of connection information. In the cluster maintenance phase, we combine 3hBAC with least cluster change (LCC) algorithm to further decrease the cluster change and to extend average clusterhead time and membership time. The performances of 3hBAC are compared with highest-connectivity clustering (HCC), random competition-based clustering (RCC) in terms of average number of clusters, average clusterhead time and average membership time. 3hBAC outperforms HCC and RCC in both the cluster formation and maintenance phase.
---
paper_title: MPBC: A Mobility Prediction-Based Clustering Scheme for Ad Hoc Networks

paper_content:

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.
---
paper_title: Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction

paper_content:

Clustering for mobile ad hoc networks (MANETs) offers a kind of hierarchical organization by partitioning mobile hosts into disjoint groups of hosts (clusters). However, the problem of changing topology is recurring and the main challenge in this technique is to build stable clusters despite the host mobility. In this paper, we present a novel clustering algorithm, which guarantees longer lifetime of the clustering structure in comparison to other techniques proposed in the literature. The basis of our algorithm is a scheme that accurately predicts the mobility of each mobile host based on the stability of its neighborhood (i.e., how different is its neighborhood over time). This information is then used for creating each cluster from hosts that will remain neighbors for sufficiently long time, ensuring the formation of clusters that are highly resistant to host mobility. For estimating the future host mobility, we use provably good information theoretic techniques, which allow on-line learning of a reliable probabilistic model for the existing host mobility.
---
paper_title: A flexible weighted clustering algorithm based on battery power for Mobile Ad hoc Networks

paper_content:

Mobile Ad hoc Networks (MANET) consist of a number of wireless hosts that communicate with each other through multi-hop wireless links in the absence of fixed infrastructure. The previous research on mobile ad-hoc network suggested the use of clustering algorithm because clustering makes it possible to guarantee basic levels of system performance, such as throughput and delay, in the presence of both mobility and a large number of mobile terminals. In this paper, we propose that the Flexible Weighted Clustering Algorithm based on Battery Power (FWCABP), leads to a high degree of stability in the network, minimizing the number of clusters, and minimizing the overhead for the clustering formation and maintenance by keeping a node with weak battery power from being elected as a cluster-head. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusters formed, reaffiliation frequency, and number of cluster-head change. Results show that our algorithm performs better than existing ones and is also tunable to different kinds of network conditions.
---
paper_title: A mobility based metric for clustering in mobile ad hoc networks

paper_content:

We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the "least clusterhead change" version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance.
---
paper_title: Adaptive Power-Aware Clustering and Multicasting Protocol for Mobile Ad Hoc Networks

paper_content:

One of the most critical issues in wireless ad hoc networks is represented by the limited availability of energy within network nodes. Most of the researches focused on the problem of routing issues rather than energy efficiency or prolongation of network lifetime. In this paper, we proposed a multicast power greedy clustering algorithm (termed as MPGC) with the mesh scheme in the multicasting protocol of ad hoc wireless networks. The greedy heuristic clustering partitions a large-scale ad hoc network into a hierarchical cluster structure. Nodes in a cluster determine adaptively their power levels so as to be power efficient. The clusterheads acting as the agents of transmit- ters/receivers can reduce efficiently bandwidth consumption and complexity of mesh structures. Besides, the mechanism of cluster maintenance can remarkably prolong the network lifetime. The power aware multicasting protocol based on ODMRP executes suitably on the super-nodes topology formed by clusterheads. The results of the simulation show that our scheme achieves better performance for ad hoc networks, in terms of network lifetime and network scalability.
---
paper_title: A Flexible Weight Based Clustering Algorithm in Mobile Ad hoc Networks

paper_content:

Clustering has been proven to be a promising approach for mimicking the operation of the fixed infrastructure and managing the resources in multi-hop networks. In order to achieve good performance, the formation and maintenance procedure of clusters should operate with minimum overhead, allowing mobile nodes to join and leave without perturbing the membership of the cluster and preserving current cluster structure as much as possible. In this paper, we propose a Flexible Weight Based Clustering Algorithm (FWCA) in Mobile Ad hoc Networks. The goals are yielding low number of clusters, maintaining stable clusters, minimizing the number of invocations for the algorithm and maximizing lifetime of mobile nodes in the system. Through simulations we have compared the performance of our algorithm with that of WCA in terms of the number of clusters formed, number of re-affiliations, number of states transitions on each clusterhead and number of clusterheads changes. The results demonstrate the superior performance of the proposed algorithm.
---
paper_title: Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks

paper_content:

In wireless ad hoc networks and sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. This paper presents two topology control protocols that extend the lifetime of dense ad hoc networks while preserving connectivity, the ability for nodes to reach each other. Our protocols conserve energy by identifying redundant nodes and turning their radios off. Geographic Adaptive Fidelity (GAF) identifies redundant nodes by their physical location and a conservative estimate of radio range. Cluster-based Energy Conservation (CEC) directly observes radio connectivity to determine redundancy and so can be more aggressive at identifying duplication and more robust to radio fading. We evaluate these protocols through analysis, extensive simulations, and experimental results in two wireless testbeds, showing that the protocols are robust to variance in node mobility, radio propagation, node deployment density, and other factors.
---
paper_title: Enhance topology control protocol(ECEC) to conserve energy based clustering in wireless ad hoc networks

paper_content:

The network in case of Mobile Adhoc networks is generally poorly defined or not defined at all. In Such a network the data can be relayed/routed by intermediate nodes whose position keeps on changing. Mobile adhoc networks have some challenges like Limited wireless transmission range, broadcast nature of the wireless medium, hidden terminal and exposed terminal problems, packet losses due to transmission errors-Mobility, induced route changes, Mobility-induced packet losses, Battery constraints, Ease of snooping, security problem. In wireless ad hoc networks and sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. This paper presents new topology control protocols that extend the lifetime of dense ad hoc networks while preserving connectivity, the ability for nodes to reach each other. Our protocols conserve energy by identifying redundant nodes and turning their radios off. Cluster-based Energy Conservation (CEC) directly observes radio connectivity to determine redundancy nodes and so can be more aggressive at identifying duplication and more robust to radio fading. In CEC, if the lifetime of any gateway (LTgateway) of the cluster is less than life time of the cluster, then there will not be any connectivity in the network for LTcluster -LTgateway amount of time. Our protocol ensures that the connectivity in the network is maintained even in the case of the above stated scenario while consuming minimum energy. In this protocol(ECEC), those nodes that can hear multiple cluster-heads broadcast velocity, position, and transmission rate and life time information,then cluster-head base on Quality that introduce in session (3.2) sort gateway. after sorting, in this paper we select 2 nodes as gateways,one of them as primary gateway and the other one as reserved gateways. reserved gateway nodes wake up in time Tg, that is smaller than Ts, and notify themselves to cluster-head, if cluster-head don't answer to them, then go to sleep.
---
paper_title: Performance Analysis of Clustering Protocols in Mobile Ad hoc Networks

paper_content:

Network clustering is an important technique widely used in efficient MANETs network management, hierarchical routing protocol design, network modeling, Quality of Service, etc. Recently many researchers are focusing on clustering which is one of the fundamental problems in mobile ad hoc networks. This article presents the descriptions of recently proposed clustering algorithms and is categorized into different approaches that support similar features. Based on the comparison of different performance metrics of different clustering algorithms, the most suitable one is recommended that adapt it to various application scenarios. This study provides adequate information for the researchers that facilitate to analyze many avenues and to offer more effective and efficient clustering protocols for MANETs.
---
paper_title: A survey of clustering schemes for mobile ad hoc networks

paper_content:

Clustering is an important research topic for mobile ad hoc networks (MANETs) because clustering makes it possible to guarantee basic levels of system performance, such as throughput and delay, in the presence of both mobility and a large number of mobile terminals. A large variety of approaches for ad hoc clustering have been presented, whereby different approaches typically focus on different performance metrics. This article presents a comprehensive survey of recently proposed clustering algorithms, which we classify based on their objectives. This survey provides descriptions of the mechanisms, evaluations of their performance and cost, and discussions of advantages and disadvantages of each clustering scheme. With this article, readers can have a more thorough and delicate understanding of ad hoc clustering and the research trends in this area.
---

Title: Survey of Clustering Schemes in Mobile Ad hoc Networks

Section 1: Introduction
Description 1: Introduce MANETs and the significance of clustering for routing, including a brief overview of hierarchical structures and challenges.

Section 2: Definition
Description 2: Define the process of clustering in MANETs, including roles of cluster head, gateway, and member nodes.

Section 3: Algorithms for Cluster Heads Election in MANETs
Description 3: Present various algorithms used for the election of cluster heads in MANETs.

Section 4: Related Work
Description 4: Summarize existing surveys and studies on clustering schemes in MANETs. Highlight their classifications and evaluation criteria.

Section 5: Clustering Schemes in Mobile Ad hoc Network
Description 5: Classify different clustering algorithms based on their objectives and cluster head election criteria, and provide detailed descriptions.

Section 6: Identifier Neighbor Based Clustering
Description 6: Discuss clustering schemes based on unique node IDs and their election processes.

Section 7: Topology Based Clustering
Description 7: Describe clustering schemes that use network topology metrics like node connectivity for cluster head selection.

Section 8: Mobility Based Clustering
Description 8: Explain clustering schemes based on the relative mobility of nodes and their impact on cluster stability.

Section 9: Energy Based Clustering
Description 9: Cover clustering algorithms focused on energy efficiency and conserving battery power of nodes.

Section 10: Weight Based Clustering
Description 10: Address clustering schemes that utilize a combination of weighted metrics for cluster head election.

Section 11: Comparison of Clustering Schemes
Description 11: Compare various clustering schemes in terms of performance metrics and effectiveness in MANETs.

Section 12: Conclusions
Description 12: Summarize key insights from the survey, including main characteristics, objectives, and performance of different clustering schemes.