Mitigating the impact of node mobility on ad hoc clustering

Authors:
Rituparna Ghosh;Stefano Basagni
Affiliations:
Department of Electrical and Computer Engineering, 312 Dana Northeastern University, Boston, MA, U.S.A.;Department of Electrical and Computer Engineering, 312 Dana Northeastern University, Boston, MA, U.S.A.
Venue:
Wireless Communications & Mobile Computing - Resources and Mobility Management in Wireless Networks
Year:
2008

Citing 0
Cited 6

Effects of mobility in hierarchical mobile ad hoc networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Clustering the wireless Ad Hoc networks: A distributed learning automata approach

Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach

Journal of Parallel and Distributed Computing
Mobile ad hoc backbones: formation and maintenance

RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Computers and Electrical Engineering
Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the impact of node mobility on distributed and mobility adaptive clustering (DMAC), a typical clustering protocol for mobile ad hoc networks. In particular, in this paper we evaluate the cost of maintaining the DMAC clustering structures when the nodes move according to three different mobility models, namely, the random way point model, the Brownian motion and the Manhattan mobility model. Via ns2-based simulations, we have observed that the mobility models have different impact on protocol performance. The general trend, however, appears to be the same for networks of increasing size. The second contribution of this paper concerns investigating ways of mitigating the impact of mobility on the clustering structure and hence over the overall network performance. We consider a generalization of DMAC (GDMAC) where rules are established to decrease the number of cluster updates. Via simulation we have observed that GDMAC is effective in reducing the clustering overhead imposed by mobility, and the corresponding maintenance cost. Copyright © 2007 John Wiley & Sons, Ltd.