Routing in LoRa for smart cities: A gossip study

Osorio, Alfonso; Calle, María; Soto, José D.; Candelo-Becerra, John E.

doi:10.1016/j.future.2022.05.028

Cited by 8 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To make gossip protocols more efficient, the authors in [41] proposed a new method by integrating fail-proof, opportunistic, and checking algorithms. In [42], a gossip-based routing algorithm was implemented to improve communications in a LoRaWAN network where all nodes have NLOS conditions. The authors proposed a novel asynchronous Laplacian in [43] that was adapted to a network of heterogeneous lattices, and showed that the resulting gossip algorithm converges asymptotically.…”

Section: Related Workmentioning

confidence: 99%

Performance Analysis of Gossip Algorithms for Large Scale Wireless Sensor Networks

Dhuli,

Atik,

Chhabra

et al. 2024

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

Gossip algorithms are often considered suitable for wireless sensor networks (WSNs) because of their simplicity, fault tolerance, and adaptability to network changes. They are based on the idea of distributed information dissemination, where each node in the network periodically sends its information to randomly selected neighbors, leading to a rapid spread of information throughout the network. This approach helps reduce the communication overhead and ensures robustness against node failures. They have been commonly employed in WSNs owing to their low communication overheads and scalability. The time required for every node in the network to converge to the average of its initial value is called the average time. The average time is defined in terms of the second-largest eigenvalue of a stochastic matrix. Thus, estimating and analyzing the average time required for large-scale WSNs is computationally complex. This study derives explicit expressions of average time for WSNs and studies the effect of various network parameters such as communication link failures, topology changes, long-range links, network dimension, node transmission range, and network size. Our theoretical expressions substantially reduced the computational complexity of computing the average time to O(n −3 ). Furthermore, numerical results reveal that the long-range links and node transmission range of WSNs can significantly reduce average time, energy consumption, and absolute error for gossip algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance Analysis of Gossip Algorithms for Large Scale Wireless Sensor Networks

Dhuli,

Atik,

Chhabra

et al. 2024

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

show abstract

“…Researchers have evaluated the feasibility of implementing gossip-based routing in wireless sensor networks, and the experimental results have demonstrated several advantages. The combination of gossip routing with flooding results in reduced power consumption, minimal traffic overhead, and improved network transmission delay [40,41].…”

Section: Related Workmentioning

confidence: 99%

Design Considerations and Performance Evaluation of Gossip Routing in LoRa-Based Linear Networks

Liaqat,

Branch,

But

2023

Future Internet

View full text Add to dashboard Cite

Linear networks (sometimes called chain-type networks) occur frequently in Internet of Things (IoT) applications, where sensors or actuators are deployed along pipelines, roads, railways, mines, and international borders. LoRa, short for Long Range, is an increasingly important technology for the IoT with great potential for linear networking. Despite its potential, limited research has explored LoRa’s implementation in such networks. In this paper, we addressed two important issues related to LoRa linear networks. The first is contention, when multiple nodes attempt to access a shared channel. Although originally designed to deal with interference, LoRa’s technique of synchronisation with a transmission node permits a novel approach to contention, which we explored. The second issue revolves around routing, where linear networks permit simpler strategies, in contrast to the common routing complexities of mesh networks. We present gossip routing as a very lightweight approach to routing. All our evaluations were carried out using real equipment by developing real networks. We constructed networks of up to three hops in length and up to three nodes in width. We carried out experiments looking at contention and routing. We demonstrate using the novel approach that we could achieve up to 98% throughput. We compared its performance considering collocated scenarios that achieved 84% and 89% throughputby using relay widths of two and three at each hop, respectively. Lastly, we demonstrate the effectiveness of gossip routing by using various transmission probabilities. We noticed high performance up to 98% throughputat Tprob = 0.90 and Tprob = 0.80 by employing two and three active relay nodes, respectively. The experimental result showed that, at Tprob = 0.40, it achieved an average performance of 62.8% and 73.77% by using two and three active relay nodes, respectively. We concluded that LoRa is an excellent technology for Internet of Things applications where sensors and actuators are deployed in an approximately linear fashion.

show abstract

“…Osorio et al [13] extended LoRaWAN with a multi-hop forwarding mechanism, which is based on a gossip algorithm. The solution improves the efficiency and flexibility of transmission, but requires intensive use of the communication channel due to the duplicated messages caused by the gossip algorithm.…”

Section: Related Workmentioning

confidence: 99%

Implementation of a LoRa Mesh Library

et al. 2022

View full text Add to dashboard Cite

LoRa is a popular communication technology in the Internet of Things (IoT) domain, providing low-power and long-range communications. Most LoRa IoT applications use the LoRaWAN architecture, which builds a star topology between LoRa end nodes and the gateway they connect to. However, LoRa can also be used for the communication between end nodes themselves, forming a mesh network topology. In this paper, we present a library that allows to integrate LoRa end nodes into a LoRa mesh network, in which a routing protocol is used. Thus, an IoT application running on these nodes can use the library to send and receive data packets to and from other nodes in the LoRa mesh network. The designed routing protocol is proactive, and maintains the routing table at each node updated by sending routing messages between neighboring nodes. The implemented library has been tested on embedded boards featuring an ESP32 microcontroller and a LoRa single-channel radio. By using our LoRa mesh library, nodes do not need to connect to a LoRaWAN gateway, but among themselves. This opens the possibility for new, distributed applications solely built upon tiny IoT nodes.INDEX TERMS LoRa, mesh network, IoT routing.

show abstract

Routing in LoRa for smart cities: A gossip study

Cited by 8 publications

References 17 publications

Performance Analysis of Gossip Algorithms for Large Scale Wireless Sensor Networks

Performance Analysis of Gossip Algorithms for Large Scale Wireless Sensor Networks

Design Considerations and Performance Evaluation of Gossip Routing in LoRa-Based Linear Networks

Implementation of a LoRa Mesh Library

Contact Info

Product

Resources

About