Gateway Planning for the Long-Range Wireless Networks in Smart Cities

Smart cities use internet to make the day-to-day living of city inhabitants more comfortable and secure. In this regard, long-range wide area networks (LoRaWAN) are ideally suited to provide IoT wireless access networks in smart city applications. LoRaWAN uses the long-range (LoRa) technology at the physical layer to provide long-range wireless connectivity. Considering the shadow fading of the large and closely located buildings in the cities, one of the key challenges in the LoRaWAN deployment is finding the optimal location of gateways while guaranteeing network coverage. In particular, the LoRa gateway deployment becomes more complicated due to the stochastic shadowing of the city buildings due to the random locations of IoT devices. In this paper, a novel analytical framework is proposed that enables the joint gateway placement and spread factor (SF) assignment in LoRaWAN while being cognizant of random building shadow fading. Inspired by the chance-constrained method, a joint stochastic gateway placement and SF assignment problem subject to network coverage constraint is formulated for LoRaWANs. Then, a new unsupervised learning-aware greedy algorithm based on the ““size-constrained weighted set cover” concept is proposed to find an approximate solution to the formulated LoRa gateway planning problem in the city environments. The proposed algorithm is simulated over the campus of Shahid Chamran University of Ahvaz at IRAN. Simulation results demonstrate the effectiveness of the proposed approach compared to the benchmarks. For example, on average, the network coverage probability under our proposed unsupervised learning-aware greedy algorithm is $15 \%$ and $10 \%$ more than the greedy and clustering ones.

Authors

Institutions

Publication Details

Published
2024-09-02
DOI
https://doi.org/10.1109/pimrc59610.2024.10817424
Citations
1
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Gateway Planning for the Long-Range Wireless Networks in Smart Cities

Sara Ranjbaran, Yousef S. Kavian, Michele Nitti, Mehdi Naderi Soorki et al.
1 citations
Advanced MIMO Systems Optimization
0.21
article

Gateway Planning for the Long-Range Wireless Networks in Smart Cities

Sara Ranjbaran, Yousef S. Kavian, Michele Nitti, Mehdi Naderi Soorki, Arash Rezazadeh
article en
1 citations

Abstract

Smart cities use internet to make the day-to-day living of city inhabitants more comfortable and secure. In this regard, long-range wide area networks (LoRaWAN) are ideally suited to provide IoT wireless access networks in smart city applications. LoRaWAN uses the long-range (LoRa) technology at the physical layer to provide long-range wireless connectivity. Considering the shadow fading of the large and closely located buildings in the cities, one of the key challenges in the LoRaWAN deployment is finding the optimal location of gateways while guaranteeing network coverage. In particular, the LoRa gateway deployment becomes more complicated due to the stochastic shadowing of the city buildings due to the random locations of IoT devices. In this paper, a novel analytical framework is proposed that enables the joint gateway placement and spread factor (SF) assignment in LoRaWAN while being cognizant of random building shadow fading. Inspired by the chance-constrained method, a joint stochastic gateway placement and SF assignment problem subject to network coverage constraint is formulated for LoRaWANs. Then, a new unsupervised learning-aware greedy algorithm based on the ““size-constrained weighted set cover” concept is proposed to find an approximate solution to the formulated LoRa gateway planning problem in the city environments. The proposed algorithm is simulated over the campus of Shahid Chamran University of Ahvaz at IRAN. Simulation results demonstrate the effectiveness of the proposed approach compared to the benchmarks. For example, on average, the network coverage probability under our proposed unsupervised learning-aware greedy algorithm is $15 \%$ and $10 \%$ more than the greedy and clustering ones.

University of Cagliari (IT), Shahid Chamran University of Ahvaz (IR), Aalto University (FI)
Sustainable cities and communities
Openalex Percentile: Top 44%
Advanced MIMO Systems Optimization
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.