25th IEEE International Conference on Distributed Computing Systems Workshops
DOI: 10.1109/icdcsw.2005.122
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: In large scale multihop wireless networks, flat architectures are not scalable. In order to overcome this major drawback, clusterization is introduced to support selforganization and to enable hierarchical routing. When dealing with multihop wireless networks the robustness is a main issue due to the dynamicity of such networks. Several algorithms have been designed for the clusterization process. As far as we know, very few studies check the robustness feature of their clusterization protocols. Moreover, when… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
61
0
13

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(74 citation statements)
references
References 16 publications
0
61
0
13
Order By: Relevance
“…WSN have received a lot of attention over the last decade above all in improving the deployment quality [14,25], self-organization [11,31], energy efficiency [19], communication aspects [34,35], and the overall reliability and security [7]. A typical application of WSN is environmental monitoring.…”
Section: Introductionmentioning
confidence: 99%
“…WSN have received a lot of attention over the last decade above all in improving the deployment quality [14,25], self-organization [11,31], energy efficiency [19], communication aspects [34,35], and the overall reliability and security [7]. A typical application of WSN is environmental monitoring.…”
Section: Introductionmentioning
confidence: 99%
“…having two nodes at distance d or less assigned a distinct color) can be enough to solve a wide range of problems. For example, local coloring at distance 3 can be used to assign TDMA time slots in an adaptive manner [7], and local coloring at distance 2 has successively been used to self-organize a wireless network into more manageable clusters [12].…”
Section: Application To Wireless Network : Fast Self-organizationmentioning
confidence: 99%
“…In [11], the stabilization time of the coloring protocol was theoretically analyzed while the stabilization time of a particular client protocol (the clustering scheme of [12]) was only studied by simulation. The analysis performed in this paper gives a theoretical upper bound on the stabilization time of all client protocols that use a coloring scheme as an underlying basis.…”
Section: Application To Wireless Network : Fast Self-organizationmentioning
confidence: 99%
“…Only basis and features which lead our motivations or which are relevant for localization and routing are evoked here. For more details or other characteristics of our clustering heuristic, please refer to [19,20,22].…”
Section: Our Cluster Organizationmentioning
confidence: 99%
“…Age(v)++ and ∀w ∈ Γ1(u) Age(w) = 0. end Locally broadcast P(u) and H(u) end As proved in [22], at the end of three message exchange rounds, each node is aware of its parent in the tree, at the end of four message rounds, it knows the parent of each of its neighbors and thus is able to determine whether one of them has elected it as parent and thus learns its condition in the tree (root, leaf, regular node). A node is a leaf if no other node has chosen it as its parent; a node is a cluster-head if it has chosen itself as parent and all its 1-neighbors have joined it; a node is a regular node otherwise.…”
Section: If (P(v) = H(v)) Thenmentioning
confidence: 99%