IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v15y2023i11p366-d1278336.html
   My bibliography  Save this article

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

Author

Listed:
  • Rao Muzamal Liaqat

    (Department of Telecommunications, Electrical, Robotics and Biomedical Engineering, Swinburne University of Technology, Melbourne 3122, Australia)

  • Philip Branch

    (Department of Telecommunications, Electrical, Robotics and Biomedical Engineering, Swinburne University of Technology, Melbourne 3122, Australia)

  • Jason But

    (Department of Telecommunications, Electrical, Robotics and Biomedical Engineering, Swinburne University of Technology, Melbourne 3122, Australia)

Abstract

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 T p r o b = 0.90 and T p r o b = 0.80 by employing two and three active relay nodes, respectively. The experimental result showed that, at T p r o b = 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.

Suggested Citation

  • Rao Muzamal Liaqat & Philip Branch & Jason But, 2023. "Design Considerations and Performance Evaluation of Gossip Routing in LoRa-Based Linear Networks," Future Internet, MDPI, vol. 15(11), pages 1-17, November.
  • Handle: RePEc:gam:jftint:v:15:y:2023:i:11:p:366-:d:1278336
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/11/366/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/15/11/366/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Martin Kenyeres & Jozef Kenyeres, 2021. "Comparative Study of Distributed Consensus Gossip Algorithms for Network Size Estimation in Multi-Agent Systems," Future Internet, MDPI, vol. 13(5), pages 1-22, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:15:y:2023:i:11:p:366-:d:1278336. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.