A New Clustering Algorithm and Relevant Theoretical Analysis for Ad-Hoc Networks

Jing Wu; Guang Xue Meng

doi:10.4028/www.scientific.net/AMM.556-562.4001

Paper Titles

Research on the Route Search Method Based on Ant-Colony Microcanonical Annealing Algorithm
p.3980

Optimization of Reactive Power Based on Dynamic Learning Factor Multi-Objective Particle Swarm Algorithm
p.3984

Multi-Path QoS Routing Algorithm Based on Disjoint Nodes for Mobile Ad Hoc Networks
p.3988

MPTCP Congestion Control Algorithm Based on the Fairness of Bottleneck
p.3995

A New Clustering Algorithm and Relevant Theoretical Analysis for Ad-Hoc Networks
p.4001

The Application of a Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem
p.4005

The Metadata Dynamic Load-Balancing Strategy of Distributed Filesystem Based on Hash Tags
p.4009

Improved Method of Hybrid Genetic Algorithm
p.4014

Text Segmentation Based on PLSA-TextTiling Model
p.4018

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562A New Clustering Algorithm and Relevant...

A New Clustering Algorithm and Relevant Theoretical Analysis for Ad-Hoc Networks

Abstract:

In ad-hoc networks, MSWCA is a typical algorithm in clustering algorithms with consideration on motion-correlativity. Aiming at MSWCA’s problem that “it only considers on intra-cluster stability, and neglects the inter-cluster stability”, a new clustering algorithm (NCA) was proposed. Firstly, NCA clustering algorithm and its cluster maintenance scheme were designed. Secondly, the theoretical quantitative analyses on average variation frequency of clusters and clustering overheads were conducted. The results show that NCA can improve cluster stability and reduce clustering overheads.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

4001-4004

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.4001

Citation:

Cite this paper

Online since:

May 2014

Authors:

Jing Wu*, Guang Xue Meng

Keywords:

Ad Hoc Network, Clustering Algorithm, Stability

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] P. Basu, N. Khan, T.D.C. Little. A mobility based metric for clustering in mobile ad hoc networks: 2001 International Conference on Distributed Computing Systems Workshop, 2001. 2001: 413-418.

DOI: 10.1109/cdcs.2001.918738

Google Scholar

[2] J.A. Torkestani, M.R. Meybodi. A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks. Computer Science, 2011, 14(4): 311-324.

DOI: 10.1007/s10586-011-0161-z

Google Scholar

[3] W. Choi, M. Woo. A distributed weighted clustering algorithm for mobile ad hoc networks: Advanced International Conference on Telecommunications-International Conference on Internet and Web Applications and Services, 2006. 2006: 73.

DOI: 10.1109/aict-iciw.2006.11

Google Scholar

[4] H. Weihong, L. Renfa, P. Xianwu. Clustering algorithms for wireless self-organized networks based on mobile holding time. Micro-computer Information, 2007, 23(9): 95-96, 119. (In Chinese).

Google Scholar

[5] Y. Tao, J. Wang, Y.L. Wang, et al. An enhanced maximum stability weighted clustering algorithm in ad hoc network: 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008. 2008: 1-4.

DOI: 10.1109/wicom.2008.600

Google Scholar

[6] J. Yi, S. Haoshan. An adaptive clustering algorithm based on mobility prediction in ad hoc networks. Computer Science, 2007, 34(3): 28-29. (In Chinese).

Google Scholar