DocumentCode
2497542
Title
A New Stable Clustering Scheme for Pseudo-Linear Highly Mobile Ad Hoc Networks
Author
Sakhaee, Ehssan ; Jamalipour, Abbas
Author_Institution
Univ. of Sydney, Sydney
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
1169
Lastpage
1173
Abstract
The concept of clustering can provide an efficient means of establishing a hierarchical structure in large-scale mobile ad hoc networks. In this paper we introduce a new stability-driven clustering algorithm for pseudo-linear highly mobile ad hoc networks such as that of communication between aircraft, ships, trains and cars on highways. The new algorithm aims at establishing stable clusters, where clusterhead re-election is reduced, and cluster membership periods are increased in the targeted system. The scheme is suitable even in systems where global positioning systems (GPS) is not available. The algorithm involves dynamic clusterhead election. Simulations show that the proposed clustering algorithm provides highly stable clusters with several advantages over previous 1-hop clustering schemes.
Keywords
ad hoc networks; mobile radio; pattern clustering; GPS; Global Positioning Systems; cluster membership periods; clusterhead reelection; dynamic clusterhead election; pseudo-linear highly mobile ad hoc networks; stability-driven clustering algorithm; stable clustering scheme; Aircraft; Clustering algorithms; Global Positioning System; Heuristic algorithms; Large-scale systems; Marine vehicles; Mobile ad hoc networks; Mobile communication; Road transportation; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.225
Filename
4411135
Link To Document