Stability-guaranteed clustering in satellite networks

Dong Ni Li*, Xin Wang, Da Kun Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Due to the nature of satellite networks, clustering for low earth orbit satellite networks is different from wireless ad hoc networks in which clustering is performed node by node. A stability-guaranteed clustering algorithm in satellite networks is proposed in this paper. Since two nodes with the furthest distance must be positioned in different clusters, a set of triplets consisting of the pair of nodes and the distance between them can be constructed, and clustering can be performed by searching for the pair of nodes with the furthest distance. Stability of the clusters is guaranteed by providing the redundant paths within and among clusters at an appropriate degree. The correctness of the algorithm is proved. Simulation results indicate it is efficient and convenient.

Original languageEnglish
Title of host publication2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Pages1817-1820
Number of pages4
DOIs
Publication statusPublished - 2007
Event2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 - Shanghai, China
Duration: 21 Sept 200725 Sept 2007

Publication series

Name2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Conference

Conference2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Country/TerritoryChina
CityShanghai
Period21/09/0725/09/07

Keywords

  • Cluster-head
  • Clustering
  • Satellite network
  • Stability

Fingerprint

Dive into the research topics of 'Stability-guaranteed clustering in satellite networks'. Together they form a unique fingerprint.

Cite this