IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i10d10.1007_s13198-024-02442-4.html
   My bibliography  Save this article

WON: A hypothetical multi-hop ad-hoc wireless ultra-large scale worldwide one network

Author

Listed:
  • Raghuram Shivram

    (B. M. S. College of Engineering)

  • B. G. Prasad

    (Dayananda Sagar College of Engineering)

  • S. Vishwa Kiran

    (BMS Institute of Technology and Management)

Abstract

This research explores the concept of Worldwide one network (WON), a hypothetical ultra-large scale ad-hoc wireless network characterized by its non-hierarchical, open, scalable, homogeneous, and autopoiesis nature. The primary objectives are to address challenges in network formation, individual node unique addressing, and network management. This paper proposes a novel addressing mechanism named ‘Cubid’, which utilizes geo-coordinates as the primary identifier for network nodes with 1 m resolution and aims for at least 512 unique node addresses per cubic meter space on Earth. Unique three-dimensional address space, received signal strength based trilateration for network formation, address negotiation, and the use of Cubid as a MAC address to bypass traditional Layer 2–3 Internet Protocol activities are few of the differentiator aspects involved in this research work. Preliminary tests of this hypothetical network yield in practical viability of identifying network node’s geographical coordinates with an accuracy of 3 m without GPS devices, and corresponding simulations results in an average frame delivery time of 27 ms over a 100-hop, varying hop length network path. These findings indicate that WON could serve as a viable alternative communication network, especially when substantial infrastructure-based networks, such as the Internet fails.

Suggested Citation

  • Raghuram Shivram & B. G. Prasad & S. Vishwa Kiran, 2024. "WON: A hypothetical multi-hop ad-hoc wireless ultra-large scale worldwide one network," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(10), pages 4714-4729, October.
    • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:10:d:10.1007_s13198-024-02442-4
    DOI: 10.1007/s13198-024-02442-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-024-02442-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-024-02442-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leo Hove, 2014. "Metcalfe’s law: not so wrong after all," Netnomics, Springer, vol. 15(1), pages 1-8, July.
    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.
    1. Pele, Daniel Traian & Mazurencu-Marinescu-Pele, Miruna, 2019. "Metcalfe's law and herding behaviour in the cryptocurrencies market," Economics Discussion Papers 2019-16, Kiel Institute for the World Economy (IfW Kiel).
    2. Leo Van Hove, 2016. "Measuring the value of mobile telecommunications networks," Netnomics, Springer, vol. 17(3), pages 191-222, November.
    3. Pele, Daniel Traian & Mazurencu-Marinescu-Pele, Miruna, 2018. "Cryptocurrencies, Metcalfe's law and LPPL models," IRTG 1792 Discussion Papers 2018-056, Humboldt University of Berlin, International Research Training Group 1792 "High Dimensional Nonstationary Time Series".
    4. Van Hove, Leo, 2016. "Testing Metcalfe's law: Pitfalls and possibilities," Information Economics and Policy, Elsevier, vol. 37(C), pages 67-76.

    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:spr:ijsaem:v:15:y:2024:i:10:d:10.1007_s13198-024-02442-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.