The impact of clustering on the average path length in wireless sensor networks

Aziz, A.A. and Şekercioğlu, Y. A. (2015) The impact of clustering on the average path length in wireless sensor networks. In: 2014 IEEE 2nd International Symposium on Telecommunication Technologies (ISTT), 24-26 Nov. 2014, Langkawi, MALAYSIA.

[thumbnail of ieee-7238172.pdf] Text
ieee-7238172.pdf - Published Version
Restricted to Repository staff only

Download (961kB)
Official URL:


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.

Item Type: Conference or Workshop Item (Paper)
Impact Factor: cited By 1
Uncontrolled Keywords: Algorithms; Wireless sensor networks, Average path length; Battery consumption; Efficient bandwidth; Information transport; Network density; Routing performance; Structured topologies; Virtual backbone, Clustering algorithms
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE: Departments > Electrical & Electronic Engineering
Depositing User: Ms Sharifah Fahimah Saiyed Yeop
Date Deposited: 26 Mar 2022 03:22
Last Modified: 09 Dec 2022 06:27

Actions (login required)

View Item
View Item