Evaluating Routing-Related Energy Expenditure in Sensor Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Information Assurance In Wireless Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Limiting the impact of mobility on ad hoc clustering
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Mobile computing: Opportunities for optimization research
Computer Communications
A cluster based mobility prediction scheme for ad hoc networks
Ad Hoc Networks
A simple and robust virtual infrastructure for massively deployed wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
In recent years, a significant number of clustering schemes have been proposed in the literature. Most of them treat cluster initialization and cluster maintenance differently as if they were two entirely different undertakings. The main contribution of this work is a unifying way of looking at clustering in MANET. We make an important point: there is no difference between cluster initialization and cluster maintenance, and one algorithm should gracefully blend into the other. To illustrate the feasibility of this concept, we propose a novel tree-based clustering algorithm for MANET based on a number of properties of diameter-2 graphs. The algorithm is cluster-centric and, unlike the vast majority of algorithms in the literature, works in the presence of node mobility. Extensive simulation results show the effectiveness of our algorithm when compared to other clustering schemes proposed in the recent literature. Copyright © 2004 John Wiley & Sons, Ltd.