dc.contributor.authorLi, Feng
dc.date.accessioned2015-01-10T03:36:34Z
dc.date.accessioned2017-07-23T08:30:16Z
dc.date.available2015-01-10T03:36:34Z
dc.date.available2017-07-23T08:30:16Z
dc.date.copyright2014en_US
dc.date.issued2014
dc.identifier.citationLi, F. (2014). Designing localized algorithms for large‐scale wireless sensor networks : a geometric perspective. Doctoral thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/62064
dc.description.abstractWireless Sensor Networks (WSNs) provide the service of monitoring and sensing physical environment. With the pervasive applications of WSNs in various fields, the increasing network scale brings considerable challenges in many aspects, from high-level applications to low-level networking and communication. In this thesis, we try to understand large-scale WSNs from geometric perspective. In particular, by exploiting the multi-fold geometric properties of WSNs (e.g., sensor nodes' locations and connectivity as well as their unique sensing/communicating models), we can build geometric models and apply geometric algorithms to address perplexing problems of large-scale WSNs. In contrast to typical geometric techniques which require global information as input, we design localized algorithms which can be performed by individual sensor nodes in a distributed manner using only locally available information, to benefit large-scale WSNs in terms of time cost, system adaptivity and robustness, energy efficiency, as well as network performance. In many applications, a large-scale WSN is deployed to monitor and survey time-variant events, which demands a fast boundary detection technique. Considering sensor nodes may be deployed in a 3D volume, the first focus of this thesis is boundary detection for large-scale 3D WSNs. We model a 3D WSN as point cloud sampled from a hypothetic 3D volume. Borrowing the idea of direct visibility, we present an on-line boundary detection algorithm to identify the sensor nodes on the boundary surfaces of the 3D volume using only local position information. Additionally, we propose a localized parametrization algorithm to regulate the detected arbitrarily shaped network boundaries into spheres, thereby supporting other network functionalities, e.g., distinguishing internal boundaries from the external one, and geographic routing. We evaluate our strategies of boundary detection and regulation with extensive implementations and simulations.en_US
dc.format.extent148 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networksen_US
dc.titleDesigning localized algorithms for large‐scale wireless sensor networks : a geometric perspectiveen_US
dc.typeThesis
dc.contributor.researchCentre for Multimedia and Network Technologyen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.contributor.supervisorHe Ying
dc.contributor.supervisorLuo Junen_US
dc.description.degreeDOCTOR OF PHILOSOPHY (SCE)en_US


Files in this item

FilesSizeFormatView
thesis.pdf10.78Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record