Subdividing hexagon-clustered wireless sensor networks for power-efficiency

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

5 Citations (Scopus)

Abstract

Hexagons are an ideal shape for clustering sensor networks, because clustered areas can be seamlessly divided by the hexagons. In addition, hexagons are the largest regular polygon (in terms of the number of sides) that has this property. In this paper, we propose a novel scheme for subdividing a hexagonal cluster where sensors are densely populated and distributed uniformly throughout the cluster. We provide an analytical estimate of power saving resulting from the subdivision, and show that our proposal gives rise to a substantial reduction in power consumption. We also perform subdivisions at various scales, and analyze the corresponding power saving patterns. Our results show that the proposed scheme will yield significant saving in overall power consumption of a cluster, and the deeper the subdivision, the less the power consumption.

Original languageEnglish
Title of host publicationProceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Pages454-458
Number of pages5
DOIs
StatePublished - 22 Apr 2009
Event2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 - Kunming, Yunnan, China
Duration: 6 Jan 20098 Jan 2009

Publication series

NameProceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Volume2

Other

Other2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
CountryChina
CityKunming, Yunnan
Period6/01/098/01/09

Fingerprint

Wireless sensor networks
Electric power utilization
Sensor networks
Sensors

Cite this

Wang, D., Xu, L., Peng, J., & Robila, S. (2009). Subdividing hexagon-clustered wireless sensor networks for power-efficiency. In Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 (pp. 454-458). [4797165] (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009; Vol. 2). https://doi.org/10.1109/CMC.2009.317
Wang, Dajin ; Xu, Li ; Peng, Jing ; Robila, Stefan. / Subdividing hexagon-clustered wireless sensor networks for power-efficiency. Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009. 2009. pp. 454-458 (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009).
@inproceedings{7952447e839441519a11da16fed6042b,
title = "Subdividing hexagon-clustered wireless sensor networks for power-efficiency",
abstract = "Hexagons are an ideal shape for clustering sensor networks, because clustered areas can be seamlessly divided by the hexagons. In addition, hexagons are the largest regular polygon (in terms of the number of sides) that has this property. In this paper, we propose a novel scheme for subdividing a hexagonal cluster where sensors are densely populated and distributed uniformly throughout the cluster. We provide an analytical estimate of power saving resulting from the subdivision, and show that our proposal gives rise to a substantial reduction in power consumption. We also perform subdivisions at various scales, and analyze the corresponding power saving patterns. Our results show that the proposed scheme will yield significant saving in overall power consumption of a cluster, and the deeper the subdivision, the less the power consumption.",
author = "Dajin Wang and Li Xu and Jing Peng and Stefan Robila",
year = "2009",
month = "4",
day = "22",
doi = "10.1109/CMC.2009.317",
language = "English",
isbn = "9780769535012",
series = "Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009",
pages = "454--458",
booktitle = "Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009",

}

Wang, D, Xu, L, Peng, J & Robila, S 2009, Subdividing hexagon-clustered wireless sensor networks for power-efficiency. in Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009., 4797165, Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, vol. 2, pp. 454-458, 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, Kunming, Yunnan, China, 6/01/09. https://doi.org/10.1109/CMC.2009.317

Subdividing hexagon-clustered wireless sensor networks for power-efficiency. / Wang, Dajin; Xu, Li; Peng, Jing; Robila, Stefan.

Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009. 2009. p. 454-458 4797165 (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009; Vol. 2).

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

TY - GEN

T1 - Subdividing hexagon-clustered wireless sensor networks for power-efficiency

AU - Wang, Dajin

AU - Xu, Li

AU - Peng, Jing

AU - Robila, Stefan

PY - 2009/4/22

Y1 - 2009/4/22

N2 - Hexagons are an ideal shape for clustering sensor networks, because clustered areas can be seamlessly divided by the hexagons. In addition, hexagons are the largest regular polygon (in terms of the number of sides) that has this property. In this paper, we propose a novel scheme for subdividing a hexagonal cluster where sensors are densely populated and distributed uniformly throughout the cluster. We provide an analytical estimate of power saving resulting from the subdivision, and show that our proposal gives rise to a substantial reduction in power consumption. We also perform subdivisions at various scales, and analyze the corresponding power saving patterns. Our results show that the proposed scheme will yield significant saving in overall power consumption of a cluster, and the deeper the subdivision, the less the power consumption.

AB - Hexagons are an ideal shape for clustering sensor networks, because clustered areas can be seamlessly divided by the hexagons. In addition, hexagons are the largest regular polygon (in terms of the number of sides) that has this property. In this paper, we propose a novel scheme for subdividing a hexagonal cluster where sensors are densely populated and distributed uniformly throughout the cluster. We provide an analytical estimate of power saving resulting from the subdivision, and show that our proposal gives rise to a substantial reduction in power consumption. We also perform subdivisions at various scales, and analyze the corresponding power saving patterns. Our results show that the proposed scheme will yield significant saving in overall power consumption of a cluster, and the deeper the subdivision, the less the power consumption.

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

U2 - 10.1109/CMC.2009.317

DO - 10.1109/CMC.2009.317

M3 - Conference contribution

AN - SCOPUS:64749100162

SN - 9780769535012

T3 - Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009

SP - 454

EP - 458

BT - Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009

ER -

Wang D, Xu L, Peng J, Robila S. Subdividing hexagon-clustered wireless sensor networks for power-efficiency. In Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009. 2009. p. 454-458. 4797165. (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009). https://doi.org/10.1109/CMC.2009.317