{"title":"伪线性高移动Ad Hoc网络的一种新的稳定聚类方案","authors":"E. Sakhaee, A. Jamalipour","doi":"10.1109/GLOCOM.2007.225","DOIUrl":null,"url":null,"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.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"A New Stable Clustering Scheme for Pseudo-Linear Highly Mobile Ad Hoc Networks\",\"authors\":\"E. Sakhaee, A. Jamalipour\",\"doi\":\"10.1109/GLOCOM.2007.225\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":370937,\"journal\":{\"name\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2007.225\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Stable Clustering Scheme for Pseudo-Linear Highly Mobile Ad Hoc Networks
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.