Back to results list
Please use this identifier to cite or link to this item:
|Title:||A k-means-based formation algorithm for the delay-aware data collection network structure||Authors:||Tsoi, PY
|Keywords:||Data collection process
Wireless sensor networks
|Issue Date:||2014||Publisher:||Institute of Electrical and Electronics Engineers||Source:||2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 13-15 Oct. 2014, Shanghai, China, p. 384–388 How to cite?||Abstract:||A wireless sensor network (WSN) consists of a large number of wireless sensor nodes that collect information from their sensing terrain. Wireless sensor nodes are, in general, battery-powered devices with limited processing and transmission power. Therefore, the lifetime of WSNs heavily depends on their energy efficiency. Multiple-cluster 2-hop (MC2H) network structure is commonly used in WSNs to reduce energy consumption due to long-range communications. However, networks with the MC2H network structure are commonly associated with long data collection processes. The delay-aware data collection network structure (DADCNS) is proposed to shorten the duration of data collection processes without sacrificing network lifetime. In this paper, a k-means-based formation algorithm for the DADCNS, namely DADCNS-RK, is proposed. The proposed algorithm can organize a network into the DADCNS, while minimizing the total communication distance among connected sensor nodes by performing k-means clustering recursively. Simulation results show that, when comparing with other DADCNSs formed by different algorithms, the proposed algorithm can reduce the total communication distances of networks significantly.||URI:||http://hdl.handle.net/10397/53654||ISBN:||978-1-4799-6235-8||DOI:||10.1109/CyberC.2014.73||Rights:||© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
The following publication Tsoi, P. -., Cheng, C. -., & Ganganath, N. (2014). A k-means-based formation algorithm for the delay-aware data collection network structure. Paper presented at the 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), p. 384-388 is available at 10.1109/CyberC.2014.73
|Appears in Collections:||Conference Paper|
Show full item record
Files in This Item:
|Tsoi_K-means-based_Formation_Algorithm.pdf||Pre-published version||266.36 kB||Adobe PDF||View/Open|
Citations as of Jul 9, 2018
Citations as of Jul 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.