By Topic

Stable Clustering and Communications in Pseudolinear Highly Mobile Ad Hoc Networks

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
$33 $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

2 Author(s)
Ehssan Sakhaee ; Grad. Sch. of Inf. Sci. & Technol., Osaka Univ., Suita ; Abbas Jamalipour

Clustering of nodes provides an efficient means of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we introduce two new stability-driven clustering algorithms for pseudolinear highly mobile ad hoc networks such as that of communication between aircraft, ships, trains, and cars on highways. The new algorithms aim at establishing stable clusters, where clusterhead reelection is reduced, and cluster membership periods are increased in the targeted system. The first algorithm is used for scenarios where the position information of nodes is not available, and the second algorithm is aimed at scenarios where position information is available [e.g., nodes are equipped with the Global Positioning System (GPS)]. The algorithms involve dynamic clusterhead election, and the scheme incorporates cluster maintenance to cater to changes in network topology as time progresses. Simulations show that the proposed clustering algorithms provide highly stable clusters with several advantages over previous one-hop clustering schemes.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:57 ,  Issue: 6 )