Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
26 Dec 2007-pp 2786-2790
TL;DR: In the context of mobile ad hoc networks (MANETs) routing, a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA) is proposed, which consists in appropriately choosing the cluster head to reduce routing overhead.
Abstract: In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The aim of CEMCA consists in appropriately choosing the cluster head to reduce routing overhead. In order to reduce traffic and energy consumption, the control messages are sent only when needed, according to the speed of the node. Each node has a quality that indicates its suitability as a cluster head. This quality takes into account the node connectivity, battery energy and mobility. These parameters are very important for the stability of the cluster. Simulation experiments are carried out to validate our algorithm in terms of stability of the clusters and their members and the quality of the connectivity. The results are compared to a previous approach called Weight Clustering Algorithm (WCA) and they show that CEMCA is performing better.
Citations
More filters
TL;DR: A mobility prediction-based clustering 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, is proposed.
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.
98 citations
TL;DR: A new clustering algorithm that considers both node position and node mobility in vehicular ad hoc environments is presented, which intends to create stable clusters by reducing reclustering overhead, prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members.
Abstract: Clustering is an important research topic in wireless networks, because cluster structures can facilitate resource reuse and increase system capacity. In this paper, we present a new clustering algorithm that considers both node position and node mobility in vehicular ad hoc environments. The proposed algorithm intends to create stable clusters by reducing reclustering overhead, prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members. Most important, this algorithm supports single and multiple cluster heads. Simulation results show the superiority of our clustering algorithm over the other three well-known algorithms.
58 citations
TL;DR: It is proved that increasing the ring inner radius from zero to a value close to the ring outer radius, the width of the average beampattern mainlobe continuously decreases and it is shown that selecting the nodes from a neighborhood close to a disc perimeter, that is, choosing the node from the narrow ring adjacent to the inner side of the disc boundary, facilitates a substantial decrease in the network energy waste and the node isolation probability.
Abstract: As the nodes in wireless sensor networks (WSNs) are independent units, an intensive communication among them is required to generate a common signal and synchronize before entering a distributed beamforming (DBF) phase. Therefore, it is crucial to select the participating nodes in DBF such that not only the resulting beampattern meets the beamforming design requirements but also the internode connectivity is retained. We consider a DBF technique for WSNs with uniformly distributed nodes and derive an average beampattern expression for a general scenario wherein the participating nodes in DBF are located on a ring with arbitrary inner and outer radii. It is proved that increasing the ring inner radius from zero to a value close to the ring outer radius, the width of the average beampattern mainlobe continuously decreases. Further, it is shown that selecting the nodes from a neighborhood close to a disc perimeter, that is, choosing the nodes from the narrow ring adjacent to the inner side of the disc boundary, facilitates a substantial decrease in the network energy waste and the node isolation probability compared to the case that the nodes are randomly selected from the whole disc. A simple approximate expression for the average beampattern is obtained in the case where the nodes are selected from a narrow ring and is used to derive the sidelobes' null and peak positions as well as a tight lower bound on the average beampattern directivity. The proposed technique is then extended to the case where the nodes are located on multiple concentric rings and the set of rings' radii are derived that guarantee an average beampattern null at a required position while substantially decreasing the sidelobe peak levels compared to the single-ring case. Finally, an average beampattern expression is obtained in the case that the nodes' signals are contaminated by noise to show that most properties of the average beampattern in the noise-free signal case carry over to the noisy signal scenario.
49 citations
23 Dec 2010
TL;DR: This paper proposes new weighted distributed clustering algorithm, called CBMD, which takes into consideration the parameters: connectivity, residual battery power, average mobility, and distance of the nodes to choose locally optimal clusterheads to maintain stable clustering structure.
Abstract: Clustering approach is an important research topic for MANETs and widely used in efficient network management, hierarchical routing protocol design, network modeling, Quality of Service, etc. Many researchers' recent focus has been on clustering management which is one of the fundamental problems in mobile ad hoc networks. The main objective of clustering in mobile ad-hoc network environments is how can an optimal clusterhead be elected and how can the optimal number of clusters be achieved through division without degrading the whole network's performance. In this paper, we propose new weighted distributed clustering algorithm, called CBMD. It takes into consideration the parameters: connectivity (C), residual battery power (B), average mobility (M), and distance (D) of the nodes to choose locally optimal clusterheads. The goals of this algorithm are maintaining stable clustering structure with a lowest number of clusters formed, to minimise the overhead for the clustering formation and maintenance and to maximise the lifespan of mobile nodes in the system. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusters formed, reaffiliation count and numbers of clusterhead changes. Results show that our algorithm performs better than existing ones and is also tuneable to different kinds of network conditions.
33 citations
25 Apr 2016
TL;DR: A new mobility-based and stability-based clustering algorithm (MSCA) for urban city scenario, which makes use of vehicle's moving direction, relative position and link lifetime estimation is proposed.
Abstract: Clustering in vehicular ad hoc networks (VANETs) is a challenging issue due to the highly dynamic vehicle mobility and frequent communication disconnections problems. Recent years' research have proven that mobility-based clustering mechanisms considering speed, moving direction, position, destination and density, were more effective in improving cluster stability. In this paper, we propose a new mobility-based and stability-based clustering algorithm (MSCA) for urban city scenario, which makes use of vehicle's moving direction, relative position and link lifetime estimation. We evaluate the performance of our proposed algorithm in terms of changing maximum lane speed and traffic flow rate. Our proposed algorithm performs well in terms of average cluster head lifetime and average number of clusters.
32 citations
References
More filters
TL;DR: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented that supports multimedia traffic and relies on both time division and code division access schemes.
Abstract: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments.
1,610 citations
"Connectivity, Energy and Mobility D..." refers background in this paper
...The second focused on Low node identifier (ID) heuristic [4] [5], the possibility to combine these two algorithms was also developed....
[...]
TL;DR: An on-demand distributed clustering algorithm for multi-hop packet radio networks that takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes, and is aimed to reduce the computation and communication costs.
Abstract: 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.
1,419 citations
"Connectivity, Energy and Mobility D..." refers background or methods in this paper
...Further, we observe that the number of clusters produced by CEMCA is lower than these produced by WCA....
[...]
...Also, the connectivity between the nodes is typically above 0.95 and better than with WCA in spite of the small value of the transmission range....
[...]
...Our results are compared with the Weighted Clustering Algorithm (WCA) [8] and they show a significant advantage of CEMCA over WCA in terms of the number of produced clusters and their stability....
[...]
...Consequently, a well connected graph can be obtained at the cost of a higher transmission range [8]....
[...]
...So, we compare the number of clusters obtained by CEMCA with those obtained by the Weighted Clustering Algorithm (WCA) [8]....
[...]
23 Jun 1999
TL;DR: A Distributed Clustered 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, giving the network a hierarchical organization.
Abstract: 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.
1,078 citations
"Connectivity, Energy and Mobility D..." refers background in this paper
...This stability is proved quantitatively by the number of cluster that is limited in a small interval [6,50 - 6,60] for 20 nodes and [7,40 - 7,60] for 40 nodes....
[...]
...The last and recent area is the weight of node that takes into account the characteristics of node in the election of cluster head [6] [7] [8] [9] and [10]....
[...]
01 Jan 1987
TL;DR: This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.
Abstract: 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.
943 citations
"Connectivity, Energy and Mobility D..." refers background in this paper
...The First area of research focused on high connectivity degree [2] [3]....
[...]
TL;DR: A self-starting, distributed algorithm is proposed and developed that establishes and maintains a reliable structure that is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper.
Abstract: In this paper we consider the problem of organizing a set of mobile, radio-equipped nodes into a connected network. We require that a reliable structure be acquired and maintained in the face of arbitrary topological changes due to node motion and/or failure. We also require that such a structure be achieved without the use of a central controller. We propose and develop a self-starting, distributed algorithm that establishes and maintains such a connected architecture. This algorithm is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper.
870 citations
"Connectivity, Energy and Mobility D..." refers background in this paper
...The First area of research focused on high connectivity degree [2] [3]....
[...]