Distributed clustering algorithms in group-based ad hoc networks

R. Massin, C. J. Le Martret, P. Ciblat

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

Abstract

For dense ad hoc networks, clustering is an appropriate strategy for improving scalability. Moreover, dense networks such as public safety or military networks are also structured through a hierarchical organization via operational groups. This organization usually impacts both the mobility of nodes which move in group, and the data flow since the traffic is mainly intra-group rather than inter-group. In this work, we extend two distributed clustering algorithms, GDMAC and VOTE, by taking into account the group structure. Our simulations of dense ad hoc networks show that our extensions lead to a lower end-to-end communication delay and offer a better stability to mobility.

Original languageEnglish
Title of host publication2015 23rd European Signal Processing Conference, EUSIPCO 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1023-1027
Number of pages5
ISBN (Electronic)9780992862633
DOIs
Publication statusPublished - 22 Dec 2015
Externally publishedYes
Event23rd European Signal Processing Conference, EUSIPCO 2015 - Nice, France
Duration: 31 Aug 20154 Sept 2015

Publication series

Name2015 23rd European Signal Processing Conference, EUSIPCO 2015

Conference

Conference23rd European Signal Processing Conference, EUSIPCO 2015
Country/TerritoryFrance
CityNice
Period31/08/154/09/15

Keywords

  • Ad hoc network
  • distributed clustering
  • operational group

Fingerprint

Dive into the research topics of 'Distributed clustering algorithms in group-based ad hoc networks'. Together they form a unique fingerprint.

Cite this