The International Conference on Information Networking 2011 (ICOIN2011) 2011
DOI: 10.1109/icoin.2011.5723190
|View full text |Cite
|
Sign up to set email alerts
|

On the generation of stable communities of users for dynamic mobile ad hoc social networks

Abstract: We present the principles, implementation and evaluation of the SAw-SHARC algorithm, a Stability Aware Sharper Heuristic for Assignment of Robust Communities. The objective of this contribution is to perform distributed detection of densely and reliably interconnected users of a wireless ad hoc network and group them in communities. Community assignment is achieved using the computation of a neighborhood similarity measure in conjunction with a node-centric estimation of the communication links relative qualit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 20 publications
(32 reference statements)
0
2
0
Order By: Relevance
“…The SandSharc algorithm addresses this problem by keeping track of a vertex state that depends on connectivity between a vertex and a community originator [5].…”
Section: Community Assignmentmentioning
confidence: 99%
See 1 more Smart Citation
“…The SandSharc algorithm addresses this problem by keeping track of a vertex state that depends on connectivity between a vertex and a community originator [5].…”
Section: Community Assignmentmentioning
confidence: 99%
“…This paper proposes to use a LPA for community detection in VANETs. Our solution is based on the existing SandSHARC LPA [5], which was designed specially for dynamic networks. The proposed method is applicable for distributed implementation, because nodes organise themselves into communities using only local knowledge about their neighbourhood.…”
Section: Introductionmentioning
confidence: 99%