A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks

Abhishek Karpate, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

With the rapid increase in applications utilizing the current advancements of wireless sensor networks, a number of problems related to self-organization, energy-awareness and network organizations have attracted many researchers in the field. Various groups have proposed grouping the sensors into clusters and design communication routes in two levels as a way to improve communication cost and better organize networks of large sensors. In this paper, we propose a new approach to cluster wireless sensors and identify cluster heads using multi-stage graph algorithms. The approach takes advantage of the optimally associated with finding matching solutions in multi-stage graph networks. The proposed solution is designed to accommodate networks with different sizes and levels of density. We tested the algorithm using different types of networks and measure the quality of the key parameters as compared to those obtained by traditional greedy heuristics. Obtained results show that the multi-stage graph approach produces better network organization and better cluster head selection which leads to be more efficient self-organized networks.

Original languageEnglish (US)
Title of host publicationSENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings
PublisherSciTePress
Pages56-62
Number of pages7
ISBN (Print)9789897580864
StatePublished - 2015
Event4th International Conference on Sensor Networks, SENSORNETS 2015 - Angers, Loire Valley, France
Duration: Feb 11 2015Feb 13 2015

Other

Other4th International Conference on Sensor Networks, SENSORNETS 2015
CountryFrance
CityAngers, Loire Valley
Period2/11/152/13/15

Fingerprint

Wireless sensor networks
Sensors
Communication
Costs

Keywords

  • Clustering
  • Energy-aware solutions
  • Graph modeling
  • Multi-stage graph algorithms
  • Self-organized networks
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Karpate, A., & Ali, H. H. (2015). A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks. In SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings (pp. 56-62). SciTePress.

A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks. / Karpate, Abhishek; Ali, Hesham H.

SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings. SciTePress, 2015. p. 56-62.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Karpate, A & Ali, HH 2015, A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks. in SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings. SciTePress, pp. 56-62, 4th International Conference on Sensor Networks, SENSORNETS 2015, Angers, Loire Valley, France, 2/11/15.
Karpate A, Ali HH. A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks. In SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings. SciTePress. 2015. p. 56-62
Karpate, Abhishek ; Ali, Hesham H. / A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks. SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings. SciTePress, 2015. pp. 56-62
@inproceedings{495e875fbcb14e3ea62ab968c07a04ca,
title = "A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks",
abstract = "With the rapid increase in applications utilizing the current advancements of wireless sensor networks, a number of problems related to self-organization, energy-awareness and network organizations have attracted many researchers in the field. Various groups have proposed grouping the sensors into clusters and design communication routes in two levels as a way to improve communication cost and better organize networks of large sensors. In this paper, we propose a new approach to cluster wireless sensors and identify cluster heads using multi-stage graph algorithms. The approach takes advantage of the optimally associated with finding matching solutions in multi-stage graph networks. The proposed solution is designed to accommodate networks with different sizes and levels of density. We tested the algorithm using different types of networks and measure the quality of the key parameters as compared to those obtained by traditional greedy heuristics. Obtained results show that the multi-stage graph approach produces better network organization and better cluster head selection which leads to be more efficient self-organized networks.",
keywords = "Clustering, Energy-aware solutions, Graph modeling, Multi-stage graph algorithms, Self-organized networks, Wireless sensor networks",
author = "Abhishek Karpate and Ali, {Hesham H}",
year = "2015",
language = "English (US)",
isbn = "9789897580864",
pages = "56--62",
booktitle = "SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings",
publisher = "SciTePress",

}

TY - GEN

T1 - A multi-stage graph approach for efficient clustering in self-organized wireless sensor networks

AU - Karpate, Abhishek

AU - Ali, Hesham H

PY - 2015

Y1 - 2015

N2 - With the rapid increase in applications utilizing the current advancements of wireless sensor networks, a number of problems related to self-organization, energy-awareness and network organizations have attracted many researchers in the field. Various groups have proposed grouping the sensors into clusters and design communication routes in two levels as a way to improve communication cost and better organize networks of large sensors. In this paper, we propose a new approach to cluster wireless sensors and identify cluster heads using multi-stage graph algorithms. The approach takes advantage of the optimally associated with finding matching solutions in multi-stage graph networks. The proposed solution is designed to accommodate networks with different sizes and levels of density. We tested the algorithm using different types of networks and measure the quality of the key parameters as compared to those obtained by traditional greedy heuristics. Obtained results show that the multi-stage graph approach produces better network organization and better cluster head selection which leads to be more efficient self-organized networks.

AB - With the rapid increase in applications utilizing the current advancements of wireless sensor networks, a number of problems related to self-organization, energy-awareness and network organizations have attracted many researchers in the field. Various groups have proposed grouping the sensors into clusters and design communication routes in two levels as a way to improve communication cost and better organize networks of large sensors. In this paper, we propose a new approach to cluster wireless sensors and identify cluster heads using multi-stage graph algorithms. The approach takes advantage of the optimally associated with finding matching solutions in multi-stage graph networks. The proposed solution is designed to accommodate networks with different sizes and levels of density. We tested the algorithm using different types of networks and measure the quality of the key parameters as compared to those obtained by traditional greedy heuristics. Obtained results show that the multi-stage graph approach produces better network organization and better cluster head selection which leads to be more efficient self-organized networks.

KW - Clustering

KW - Energy-aware solutions

KW - Graph modeling

KW - Multi-stage graph algorithms

KW - Self-organized networks

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84938771870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938771870&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9789897580864

SP - 56

EP - 62

BT - SENSORNETS 2015 - 4th International Conference on Sensor Networks, Proceedings

PB - SciTePress

ER -