A Design of Efficient Cluster Sensor Network Using Approximate Steiner Minimum Tree


The KIPS Transactions:PartA, Vol. 17, No. 2, pp. 103-112, Apr. 2010
10.3745/KIPSTA.2010.17.2.103,   PDF Download:

Abstract

Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O(N2) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees’ average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
I. B. Kim, "A Design of Efficient Cluster Sensor Network Using Approximate Steiner Minimum Tree," The KIPS Transactions:PartA, vol. 17, no. 2, pp. 103-112, 2010. DOI: 10.3745/KIPSTA.2010.17.2.103.

[ACM Style]
In Bum Kim. 2010. A Design of Efficient Cluster Sensor Network Using Approximate Steiner Minimum Tree. The KIPS Transactions:PartA, 17, 2, (2010), 103-112. DOI: 10.3745/KIPSTA.2010.17.2.103.