Long range (LoRa) is one of the most successful low-power wide-area networking technologies because it is ideally suited for long-distance, low-bit rate, and low-power communications in the unlicensed sub-GHz spectrum utilized for Internet of things (IoT) networks. The effectiveness of LoRa depends on the link budget (i.e., spreading factor (SF), bandwidth (BW), and transmission power (TX)). Due to the near–far effect, the allocation of a link budget to LoRa devices (LDs) in large coverage regions is unfair between them depending on their distance to the GW. Thus, more transmission opportunities are given to some LDs to the detriment of other LD’s opportunities. Numerous studies have been conducted to address the prevalent near–far fairness problem. Due to the absence of a tractable analytical model for fairness in the LoRa network, however, it is still difficult to solve this problem completely. Thus, we propose an SF-partition-based clustering and relaying (SFPCR) scheme to achieve enormous LD connectivity with fairness in IoT multihop LoRa networks. For the SF partition, the SFPCR scheme determines the suitable partitioning threshold point for bridging packet delivery success probability gaps between SF regions, namely, the lower SF zone (LSFZ) and the higher SF zone (HSFZ). To avoid long-distance transmissions to the GW, the HSFZ constructs a density-based subspace clustering that generates clusters of arbitrary shape for adjacent LDs and selects cluster headers by using a binary score representation. To support reliable data transmissions to the GW by multihop communications, the LSFZ offers a relay LD selection that ideally chooses the best relay LD to extend uplink transmissions from LDs in the HSFZ. Through simulations, we show that the proposed SFPCR scheme exhibits the highest success probability of 65.7%, followed by the FSRC scheme at 44.6%, the mesh scheme at 34.2%, and lastly the cluster-based scheme at 29.4%, and it conserves the energy of LDs compared with the existing schemes.
Long range (LoRa) is a low-power wide-area technology because it is eminent for robust long-distance, low-bitrate, and low-power communications in the unlicensed sub-GHz spectrum used for the Internet of things (IoT) networks. Recently, several multi-hop LoRa networks have proposed schemes with explicit relay nodes to partially mitigate the path loss and longer transmission time bottlenecks of the conventional single-hop LoRa by focusing more on coverage expansion. However, they do not consider improving the packet delivery success ratio (PDSR) and the packet reduction ratio (PRR) by using the overhearing technique. Thus, this paper proposes an implicit overhearing node-based multi-hop communication (IOMC) scheme in IoT LoRa networks, which exploits implicit relay nodes for performing the overhearing to promote relay operation while satisfying the duty cycle regulation. In IOMC, implicit relay nodes are selected as overhearing nodes (OHs) among end devices with a low spreading factor (SF) in order to improve PDSR and PRR for distant end devices (EDs). A theoretical framework for designing and determining the OH nodes to execute the relay operations was developed with consideration of the LoRaWAN MAC protocol. Simulation results verify that IOMC significantly increases the probability of successful transmission, performs best in high node density, and is more resilient to poor RSSI than the existing schemes.
The technique of vehicular clouds is considered an attractive approach in VANETs, because it provides a requester vehicle the ability to use resources of neighborhood vehicles (called cloud member vehicles) to construct a vehicular cloud to use next-generation vehicular applications during driving. Generally, member vehicles can move along different routes from the route of the requester vehicle in intersections and, as a result, leave the vehicular cloud. Then, the leaving member vehicle should be replaced by new member vehicles at intersections to reconstruct the vehicular cloud. However, identifying optimal replacement vehicles among many vehicles at intersections is a very difficult task involving minimizing the waste of resources of vehicles due to their irregular mobility. Thus, we propose an optimal member replacement scheme that finds optimal replacement vehicles through the improved mobility prediction of vehicles by borrowing the computational ability of RSUs on intersections. The proposed scheme first makes an improved mobility prediction model by combining both the trajectory prediction of vehicles using the Markov model and the location prediction of vehicles using the Gaussian distribution. Through the improved mobility prediction model, the proposed scheme then determines the leaving member vehicles and calculates their own leaving time. Next, the proposed scheme addresses the problem to find optimal replacement vehicles to minimize the waste resource and solves it through an integer linear programming. For the performance evaluation of the proposed scheme, we implement it in an NS-3 simulator, which includes the Manhattan mobility model, to reflect the mobility of vehicles on roads. Simulation results conducted in various environments verify that the proposed scheme achieves better performance than the existing scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.