By Topic

Connection Stability Analyze Based on Dynamic Clustering Algorithm for Mobile Ad hoc Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Limin Meng ; Coll. of Inf. Eng., ZheJiang Univ. of Technol., Hangzhou ; Kai Zhou ; Jingyu Hua ; Zhijiang Xu
more authors

With the increase in size and application are of the communication network, more attention has been paid to the invulnerability of mobile ad hoc network. Based on studying deeply in the characteristic of mobile ad hoc network, analyzing the shortages in invulnerability algorithm previously, this paper presents a mathematically tractable model of node motion to derive a precise relation between mobility and connection stability. We improve the first order energy consumption model with dynamic clustering firstly and then build a incidence matrix to depict the connectivity of the network nodes in a dynamic network model. Finally, we simulate the network invulnerability related to time. As a result, it validates the high invulnerability of the dynamic clustering ad hoc networks.

Published in:

Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on  (Volume:2 )

Date of Conference:

6-8 Jan. 2009