Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication 2013
DOI: 10.1145/2448556.2448594
|View full text |Cite
|
Sign up to set email alerts
|

Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0
6

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 13 publications
(22 citation statements)
references
References 14 publications
0
16
0
6
Order By: Relevance
“…In the literature, some clustering solutions have been proposed for building 1‐hop clusters; the distance between the cluster head and any node is at most 1. Other solutions build k‐hop clusters in which the distance is at most k between the cluster head and any node. In our proposed solution, any cluster architecture can be used.…”
Section: Architectures For Software‐defined Wireless Sensor Network:mentioning
confidence: 99%
See 1 more Smart Citation
“…In the literature, some clustering solutions have been proposed for building 1‐hop clusters; the distance between the cluster head and any node is at most 1. Other solutions build k‐hop clusters in which the distance is at most k between the cluster head and any node. In our proposed solution, any cluster architecture can be used.…”
Section: Architectures For Software‐defined Wireless Sensor Network:mentioning
confidence: 99%
“…Organizing the sensor nodes into clusters minimizes the number of control message exchanges and increases security. In our clustering solution, called SDCSN, we assume that each cluster head is an SDN controller and the other nodes can be in one of the following states (as defined in previous studies): simple node (SN) or gateway node (GN). The cluster head of the cluster is an SDN controller, called (SDNCH), defined in Gonzalez et al and illustrated Figure .…”
Section: Sdcsn: Software‐defined Clustered Sensor Network Architecturementioning
confidence: 99%
“…In those solutions, each node is at a most a distance of 1 from the cluster head, and the maximum diameter of each cluster is 2. Other solutions build k-hops clusters [15], [16], [24]. In k-hop cluster solutions, each node can be located at a distance at most of k from the cluster head and the maximum diameter of clusters is 2k.…”
Section: State Of the Artmentioning
confidence: 99%
“…For this reason, we propose to cluster the network and assume that each cluster head is a controller. Each node can be in one of the following states [5], [6], [24]: Simple Node (SN), Gateway Node (GN) or Cluster Head (CH). In our approach, Cluster Head (CH) in SDCSN architecture are called SDN Cluster Head (SDNCH).…”
Section: The Software Defined Clustered Sensor Network Architecmentioning
confidence: 99%
See 1 more Smart Citation