Please use this identifier to cite or link to this item:
http://20.198.91.3:8080/jspui/handle/123456789/8742| Title: | A study of optimising sensor placement in smart cities based on circle packing problem |
| Authors: | Mandal, Koustav |
| Advisors: | Mukherjee, Nandini Mandal, Chintan Kr. |
| Keywords: | Sensor placement;Circle Packing |
| Issue Date: | 2022 |
| Publisher: | Jadavpur University, Kolkata, West Bengal |
| Abstract: | The smart city is an idea of using computerised innovations to improve and upgrade the existence of a city's occupants. This idea has been the subject of expanding interest throughout recent years. Notwithstanding, most investigations address further developing parts of a city's foundation, for example, data security, protection, correspondence organisations, government, and transportation. Smart urban communities manage basic and day to day issues, including homes and structures, climate, transportation, medical services, energy, training, and assembling . The Internet of Things (IoT) coordinates multiple items, like sensors, cell phones, actuators, houses, and machines, into an organisation to involve their information for constant dynamic sensor sending, is the strategy for setting sensors in an ideal region, is viewed as a difficult issue for specialists and engineers. Smart cities are enabled by placing sensors at strategic positions, such that they can communicate among themselves. In this proposal, we present an algorithm to place the sensors, represented as circles of various radii inside a rectangular region such that the distance between circles is minimized. The circles can be placed such that they overlap to some extent, touch each other at the boundary or do not touch each other. |
| URI: | http://20.198.91.3:8080/jspui/handle/123456789/8742 |
| Appears in Collections: | Dissertations |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| M.E. (Computer Science and Engineering) Koustav Mandal.pdf | 2.97 MB | Adobe PDF | View/Open |
Items in IR@JU are protected by copyright, with all rights reserved, unless otherwise indicated.