A Clustering Algorithm Based on Mobility Properties in Mobile Ad Hoc Networks

Young-jun Oh and Kang-whan Lee

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 6, 567269

Abstract: We propose a context-awareness routing algorithm—the DDV- (Dynamic Direction Vector-) hop algorithm—in mobile ad hoc networks. The existing algorithm in MANET has the limitations of the dynamic network topology and the absence of network expandability of the mobility of nodes. The proposed algorithm performs cluster formation for the base station using the range of direction and threshold of velocity. We calculate the exchange of the cluster head node probability using the direction and velocity for maintaining cluster formation. The DDV-hop algorithm, a probabilistic routing protocol for such networks, is proposed and then compared to the earlier presented algorithms through simulations. The simulations are conducted on a number of clusters, network areas, transmission ranges, and velocity of nodes in mobile networks. Our results suggest that the DDV-hop algorithm demonstrates efficiency of eventual delivery and maintains the proper number of clusters and cluster members regardless of topology changes with a lower communication overhead in several interesting environments.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/567269 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:6:p:567269

DOI: 10.1155/2015/567269

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().