TY  - CONF
PB  - Institute of Electrical and Electronics Engineers Inc.
N2  - Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. They organize the nodes into smaller groups and form a structured topology allowing more efficient bandwidth usage and battery consumption. As the clustering algorithms are usually used for routing, it is crucial to measure the efficiency of the generated backbone in information transport. Failure to do so will impact the routing performance and reduce the reliability of the system. This paper investigates whether the backbone formed by clustering algorithms is able to preserve the routing paths of the network. This property is evaluated by comparing the performance of several clustering algorithms with respect to the average path length. In order to obtain accurate results, the performance is investigated under different network sizes as well as network densities. © 2014 IEEE.
AV  - none
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-84946600160&doi=10.1109%2fISTT.2014.7238172&partnerID=40&md5=09a247e2c393930b72ffba562f88d1c9
EP  - 38
A1  - Aziz, A.A.
A1  - Å?ekercioÊ?lu, Y.A.
Y1  - 2015///
SN  - 9781479959822
TI  - The impact of clustering on the average path length in wireless sensor networks
ID  - scholars5762
SP  - 34
KW  - Algorithms; Wireless sensor networks
KW  -  Average path length; Battery consumption; Efficient bandwidth; Information transport; Network density; Routing performance; Structured topologies; Virtual backbone
KW  -  Clustering algorithms
N1  - cited By 1; Conference of 2nd IEEE International Symposium on Telecommunication Technologies, ISTT 2014 ; Conference Date: 24 November 2014 Through 26 November 2014; Conference Code:115880
ER  -