ldacs-greedy-k-hop-routing

https://github.com/comnetshh/ldacs-greedy-k-hop-routing

Science Score: 67.0%

This score indicates how likely this project is to be science-related based on various indicators:

✓
CITATION.cff file
Found CITATION.cff file
✓
codemeta.json file
Found codemeta.json file
✓
.zenodo.json file
Found .zenodo.json file
✓
DOI references
Found 3 DOI reference(s) in README
✓
Academic publication links
Links to: zenodo.org
○
Academic email domains
○
Institutional organization owner
○
JOSS paper metadata
○
Scientific vocabulary similarity
Low similarity (5.0%) to scientific vocabulary

Last synced: 6 months ago · JSON representation ·

Repository

Basic Info

Host: GitHub
Owner: ComNetsHH
License: lgpl-3.0
Language: C++
Default Branch: main
Size: 108 KB

Statistics

Stars: 1
Watchers: 4
Forks: 0
Open Issues: 0
Releases: 7

Created almost 2 years ago · Last pushed over 1 year ago

Metadata Files

Readme License Citation

LDACS-Greedy-K-Hop-Routing

Overview

LDACS-Greedy-K-Hop-Routing is a core component of the LDACS-Greedy-K-Hop-Simulator project. It introduces three novel routing methods—Greedy-FFT, Greedy-EFFT, and Greedy-Random—for selecting subsets of neighbors at precisely k-hop distances. This module implements the Greedy-k forwarding technique to enhance the routing efficiency over the conventional Greedy-1 approach by leveraging knowledge of the k-hop neighborhood. To accommodate the limitations of LDACS A2A slot capacities, our approach integrates a subset of 1-hop neighbors within beacon messages, while utilizing unused beacon slots to extend this insight to 2-hop and partially to 3-hop neighbors. This strategy provides a balanced view of the network topology, optimizing routing decisions and communication overhead within the constraints of LDACS A2A communications.

Installation

Clone the repository and follow the setup instructions: bash git clone https://github.com/ComNetsHH/LDACS-Greedy-K-Hop-Routing.git cd LDACS-Greedy-K-Hop-Routing/simulation make build-releases

Owner

Name: Institute of Communication Networks
Login: ComNetsHH
Kind: organization
Location: Hamburg, Germany

Website: https://www.tuhh.de/comnets
Repositories: 41
Profile: https://github.com/ComNetsHH

Institute of Communication Networks (ComNets) at Hamburg University of Technology (TUHH)

Citation (CITATION.cff)

cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
  - family-names: Ahmed
    given-names: Musab
    orcid: https://orcid.org/0000-0001-5554-3414
  - family-names: Fuger
    given-names: Konrad
    orcid: https://orcid.org/0000-0002-8472-1483
  - family-names: Kuladinithi
    given-names: Koojana
    orcid: https://orcid.org/0000-0001-6083-4048
  - family-names: Timm-Giel
    given-names: Andreas
    orcid: https://orcid.org/0000-0002-5998-6113
title: "LDACS Greedy K-Hop Routing"
version: 1.0.5
doi: 10.5281/zenodo.12826688
date-released: 2024-07-25

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Open Source Science