TY - GEN
T1 - Cliques and clusters based hierarchical scheme for sensor networks partitioning
AU - Lakhlef, Hicham
AU - Bentaleb, Abdelhak
AU - Myoupo, Jean Frederic
AU - Boubetra, Abdelhak
AU - Harous, Saad
PY - 2013
Y1 - 2013
N2 - The hierarchical clustering for wireless sensors networks is treated to solve the scalability problem in routing protocols for multi-hop wireless networks. Also a clustering-based technique is proposed to provide location management of devices for QoS support. To the best of our knowledge there is no protocol that combines the hierarchical partitioning into clusters and cliques taking into account the size of cliques and clusters (a clique is a network where every node can communicate directly with every other node in the same clique). In this paper, we propose a new partitioning scheme motivated by the need to have minimum and maximum size for cliques and clusters. In fact, this size has a direct effect on energy consumption. Indeed, for a large size of clique or cluster the cluster head should register the identities of its cluster members and manage them. That is not always feasible because sensor networks have a very limited memory capacity and energy. In addition, limiting the number of sensors in each clique or cluster avoids a significant number of cluster head re-election where the energy will be the parameter of election. So the characteristics of WSN are not satisfied, the aim of our work is to deal with these cases.
AB - The hierarchical clustering for wireless sensors networks is treated to solve the scalability problem in routing protocols for multi-hop wireless networks. Also a clustering-based technique is proposed to provide location management of devices for QoS support. To the best of our knowledge there is no protocol that combines the hierarchical partitioning into clusters and cliques taking into account the size of cliques and clusters (a clique is a network where every node can communicate directly with every other node in the same clique). In this paper, we propose a new partitioning scheme motivated by the need to have minimum and maximum size for cliques and clusters. In fact, this size has a direct effect on energy consumption. Indeed, for a large size of clique or cluster the cluster head should register the identities of its cluster members and manage them. That is not always feasible because sensor networks have a very limited memory capacity and energy. In addition, limiting the number of sensors in each clique or cluster avoids a significant number of cluster head re-election where the energy will be the parameter of election. So the characteristics of WSN are not satisfied, the aim of our work is to deal with these cases.
KW - Wireless Sensor Networks
KW - clique
KW - clustering
KW - energy
KW - hierarchical scheme
KW - partitioning
UR - http://www.scopus.com/inward/record.url?scp=84893631600&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893631600&partnerID=8YFLogxK
U2 - 10.1109/IEEEGCC.2013.6705804
DO - 10.1109/IEEEGCC.2013.6705804
M3 - Conference contribution
AN - SCOPUS:84893631600
SN - 9781479907243
T3 - 2013 7th IEEE GCC Conference and Exhibition, GCC 2013
SP - 355
EP - 360
BT - 2013 7th IEEE GCC Conference and Exhibition, GCC 2013
T2 - 2013 7th IEEE GCC Conference and Exhibition, GCC 2013
Y2 - 17 November 2013 through 20 November 2013
ER -