## WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks (2001)

### Cached

### Download Links

- [crewman.uta.edu]
- [crewman.uta.edu]
- [www.eecs.ucf.edu]
- [www.cs.ucf.edu]
- [www.cs.ucf.edu]
- [www.cs.ucf.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks |

Citations: | 162 - 7 self |

### BibTeX

@ARTICLE{Chatterjee01wca:a,

author = {Mainak Chatterjee and Sajal K. Das and Damla Turgut},

title = {WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks},

journal = {Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks},

year = {2001},

volume = {5},

pages = {193--204}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of the nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence a reconguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads, form a 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-dened threshold to facilitate the optimal o

### Citations

2360 | Dynamic Source Routing in Ad hoc Wireless Networks”, Mobile Computing - Johnson, Maltz - 1996 |

248 | Distributed clustering for ad hoc networks
- Basagni
- 1999
(Show Context)
Citation Context ...cluster. Clusters may change dynamically, re ecting the mobility of the underlying network. The focus of the existing literature in this area has mostly been on partitioning the network into clusters =-=[5,6,11,13,14]-=-, without taking into consideration the ecient functioning of all the system components. The lack of rigorous methodologies applicable to the design and analysis of peer-to-peer mobile networks has mo... |

246 | Routing in Ad Hoc Networks of Mobile Hosts - Johnson - 1994 |

215 |
A design concept for reliable mobile radio networks with frequency hopping signalling
- Ephremides, Anthony, et al.
- 1987
(Show Context)
Citation Context ...-Degree heuristic, (ii) Lowest-ID heuristic, and (iii) Node-Weight heuristic. The Lowest-ID and the Highest-Degree were the two clustering algorithms which were based on the link-cluster architecture =-=[3,4,10]-=-. In the assumed graph model of the network, the mobile terminals are represented as nodes; there exists an edge between two nodes if they can communicate with each other directly (i.e., one node lies... |

190 |
The architectural organization of a mobile radio network via a distributed algorithm
- Baker, Ephremides
- 1981
(Show Context)
Citation Context ...-Degree heuristic, (ii) Lowest-ID heuristic, and (iii) Node-Weight heuristic. The Lowest-ID and the Highest-Degree were the two clustering algorithms which were based on the link-cluster architecture =-=[3,4,10]-=-. In the assumed graph model of the network, the mobile terminals are represented as nodes; there exists an edge between two nodes if they can communicate with each other directly (i.e., one node lies... |

164 | A mobility-based framework for adaptive clustering in wireless ad hoc networks,” in
- McDonald, Znati
- 1999
(Show Context)
Citation Context ...for routing messages in ad hoc networks [16-20]. This paper does not propose or deal with any routing algorithm. It can be noted that the number of hops a message makes in a clusterhead based routing =-=[19]-=- depends on the number of clusterheads in the network. It is not recommended to have too few or too many clusterheads in the network. It is our belief that our clustering algorithm will help routing a... |

111 | A peer-to-peer zone-based two-level link state routing for mobile ad-hoc wireless networks
- Joa-Ng, Lu
- 1999
(Show Context)
Citation Context ...ticipating nodes will result in high computation overhead. The concept of dividing the geographical region to be covered into small zones has been presented implicitly as clustering in the literature =-=[16]. A n-=-atural way to map a \standard" cellular architecture into a multi-hop packet radio network is via the concept of a virtual cellular network [9]. Any node can become a clusterhead if it has the ne... |

110 |
multimedia radio network
- Gerla, Tsai, et al.
- 1995
(Show Context)
Citation Context ...cluster. Clusters may change dynamically, re ecting the mobility of the underlying network. The focus of the existing literature in this area has mostly been on partitioning the network into clusters =-=[5,6,11,13,14]-=-, without taking into consideration the ecient functioning of all the system components. The lack of rigorous methodologies applicable to the design and analysis of peer-to-peer mobile networks has mo... |

63 | Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks
- Basagni
- 1999
(Show Context)
Citation Context ...eir neighbor list. This eect may propagate and add overhead to the system. Moreover, it does not attempt to balance the load uniformly across all the nodes. 2.3. Node-Weight Heuristic Basagni et al. [=-=6,7-=-] proposed two algorithms, namely distributed clustering algorithm (DCA) and distributed mobility-adaptive clustering algorithm (DMAC). In their approach, each node is assigned weights (a real number ... |

57 |
Selecting routers in ad hoc wireless networks
- Parekh
- 1994
(Show Context)
Citation Context ...id and moved with dierent speeds in dierent directions. 2.1. Highest-Degree Heuristic The Highest-Degree, also as known as connectivity-based clustering, was originally proposed by Gerla and Parekh [1=-=1,20]-=- in which the degree of a node is computed based on its distance from others. Each node broadcasts its id to the nodes that are within its transmission range. A node x is considered to be a neighbor o... |

56 | Load-balancing clusters in wireless ad hoc networks
- Amis, Prakash
- 2000
(Show Context)
Citation Context ...e radio resources, has also to route messages for other nodes belonging to dierent clusters. Therefore, it is not desirable to have any clusterhead overly loaded while some others are lightly loaded [=-=2]-=-. At the same time, it is dicult to maintain a perfectly load balanced system at all times due to frequent detachment and attachment of the nodes from and to the clusterheads. To quantitatively measur... |

46 |
Clustering algorithms for wireless ad hoc networks
- Aggarwal, Kapoor, et al.
- 2000
(Show Context)
Citation Context ...s are its immediate neighbors and lie well within its transmission range. For example, Bluetooth [1] employs a Master-Slave model where the clusterhead is the master and can handle up to seven slaves =-=[21]-=-. Thus, the load handling capacity of the clusterhead puts an upper bound on the node-degree. In other words, simply covering the area with the minimum number of clusterheads will put more burden on t... |

39 | A Generalized Clustering Algorithm for Peer-to-Peer Networks - Basagni, Chlamtac, et al. - 1997 |

33 |
A new approach to the design and analysis of peer-to-peer mobile networks
- Chlamtac, Farago
- 1999
(Show Context)
Citation Context ...rheads optimally is an NP-hard problem [5]. Thus existing solutions to this problem are based on heuristic (mostly greedy) approaches and none attempts to retain the stability of the network topology =-=[5,9]-=-. We believe a good clustering scheme should preserve its structure as much as possible when nodes are moving and/or the topology is slowly changing. Otherwise, re-computation of clusterheads and freq... |

32 | An on-demand weighted clustering algorithm (WCA) for ad hoc networks
- Chatterjee, Das, et al.
- 2000
(Show Context)
Citation Context ...clusterhead and attaches to another clusterhead then the involved clusterheads update their member list instead of invoking the election algorithm. A preliminary version of this algorithm appeared in =-=[8-=-]. 3.4.1. Clusterhead Election Procedure The procedure consists of eight steps as described below. Step 1: Find the neighbors of each node v (i.e., nodes within its transmission range) which denes its... |

27 |
Wireless and Cellular Telecommunication
- Lee
(Show Context)
Citation Context ...e stations is of the order of 2-3 miles. But in ad hoc networks, the distances involved are rather small (approximately hundreds of meters). In this range, the attenuation can be assumed to be linear =-=[12]-=-. The third component for W v is due to mobility of the nodes. As discussed in Section 3.3, a node with less mobility is always a better choice for a clusterhead. The last component P v , is measured ... |

24 |
A Distributed Architecture for Multimedia in a Multihop Dynamic Packet Radio Network
- Lin, Gerla
- 1995
(Show Context)
Citation Context ...cluster. Clusters may change dynamically, re ecting the mobility of the underlying network. The focus of the existing literature in this area has mostly been on partitioning the network into clusters =-=[5,6,11,13,14]-=-, without taking into consideration the ecient functioning of all the system components. The lack of rigorous methodologies applicable to the design and analysis of peer-to-peer mobile networks has mo... |

22 | A distributed control scheme in multi-hop packet radio networks for voice/data traffic support
- Lin, Gerla
- 1995
(Show Context)
Citation Context |

20 |
A distributed algorithm for organizing mobile radio telecommunication networks
- Baker, Ephremides
- 1981
(Show Context)
Citation Context ...-Degree heuristic, (ii) Lowest-ID heuristic, and (iii) Node-Weight heuristic. The Lowest-ID and the Highest-Degree were the two clustering algorithms which were based on the link-cluster architecture =-=[3,4,10]-=-. In the assumed graph model of the network, the mobile terminals are represented as nodes; there exists an edge between two nodes if they can communicate with each other directly (i.e., one node lies... |

20 | multimedia radio network”, Wireless Networks - Gerla, Tsai, et al. - 1995 |

2 |
Random Graphs
- Bollbas
- 1985
(Show Context)
Citation Context ...s. As the underlying graph does not show any regular structure, partitioning the graph optimally (i.e., with minimum number of partitions) with respect to certain parameters becomes a NP-hard problem =-=[1-=-5]. More formally, we look for the set of vertices S V (G), such that [ v2S N [v] = V (G). Here, N [v] is the neighborhood of v, dened as N [v] = S v 0 2V; v 0 6=v n v 0 jdist(v; v 0 )srange o where ... |

1 |
A Generalized Clustering Algorithm for Peerto -Peer Networks
- Basagni, Chlamtac, et al.
- 1997
(Show Context)
Citation Context ...quent clusterhead changes adversely aect the performance of other protocols such as scheduling, routing and resource allocation that rely on it. Choosing clusterheads optimally is an NP-hard problem [=-=5]-=-. Thus existing solutions to this problem are based on heuristic (mostly greedy) approaches and none attempts to retain the stability of the network topology [5,9]. We believe a good clustering scheme... |

1 |
The eect of radio propagation on multimedia, mobile, multihop networks: models and countermeasures
- Wu, Tsai, et al.
- 1994
(Show Context)
Citation Context ...pdate in the event of a change in the dominant set is much more than a realiation. A clusterhead is able to communicate better to its neighbors having closer distances within the transmission range [=-=22]-=-. As the nodes move away from the clusterhead, the communication may become dicult due mainly to signal attenuation with increasing distance. 3.4. Proposed Algorithm Based on the preceding discussion,... |

1 | received his B.Sc. degree in physics (Hons) from the University of Calcutta in - Chatterjee - 1994 |

1 | is a recipient of the TxTEC (Texas Telecommunications Engineering Consortium) fellowship and is a IEEE-CS student member. E-mail: chat@cse.uta.edu Sajal K. Das is currently a Full Professor of Computer Science and Engineering and the founding Director of - He |