Please use this identifier to cite or link to this item: http://dspace.aiub.edu:8080/jspui/handle/123456789/1776
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHaque, Md Enamul-
dc.contributor.authorRahman, Md Muntasir-
dc.contributor.authorRahman, Aminur-
dc.contributor.authorImtiaz-Ud-Din, KM-
dc.date.accessioned2023-11-08T05:59:23Z-
dc.date.available2023-11-08T05:59:23Z-
dc.date.issued2014-12-22-
dc.identifier.citation10en_US
dc.identifier.other10.1109/ICCITechn.2014.7073074-
dc.identifier.urihttp://dspace.aiub.edu:8080/jspui/handle/123456789/1776-
dc.description.abstractIn this paper, we propose a novel clustering protocol for wireless sensor and robot networks (WSRN) to ensure efficient energy usage and maintain maximum connectivity among the sensors. Our algorithm mainly works in two phases: (i) creates optimal number of clusters in the region of interest via three-point centroidal voronoi diagram. (ii) aggregates data from the members of each cluster and transfers to base station. This protocol is designed using double layered adaptive clustering and unknown region exploration which can be changed when needed for specific application. Additionally, this protocol works without the prior knowledge of the deployment region. We compared the results with LEACH and LEACH-C as a proof of concept. Specifically, simulation results exploit higher level of performance improvement in terms of energy dissipation, node failure, transmission overhead, and data aggregation among large number of mobile sensors. Finally, we analyzed the protocol with different settings which manifest the viability of our design.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.titleCentroidal voronoi tessellation based energy efficient clustering protocol for heterogeneous wireless sensor and robot networksen_US
dc.typeArticleen_US
Appears in Collections:Publications: Conference

Files in This Item:
File Description SizeFormat 
Dspace - Paper 1.docx384.85 kBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.