Sciweavers

403 search results - page 4 / 81
» Merging Clustering Algorithms in Mobile Ad Hoc Networks
Sort
View
BROADNETS
2005
IEEE
15 years 3 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin
MOBIHOC
2002
ACM
15 years 9 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
IFIP
2003
Springer
15 years 2 months ago
Self-Organising Node Address Management in Ad Hoc Networks
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
Stephen Toner, Donal O'Mahony
CIT
2004
Springer
15 years 2 months ago
Associativity Based Mobility-Adaptive K-Clustering in Mobile Ad-Hoc Networks
To solve the scalability issue of ad hoc network, a new cluster maintenance protocol is proposed. Clusters may change dynamically, reflecting the mobility of the underlying networ...
Chinnappan Jayakumar, Chenniappan Chellappan
ISPA
2004
Springer
15 years 2 months ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu