DRAGON: A Dynamic Distributed Resource Allocation Algorithm for Wireless Networks

Miri, Mohammadhasan; Darmani, Yousef; Mohamed-pour, Kamal; Yaghoubi, Mohammad Ali; Sarkar, Mitali

doi:10.1109/lcomm.2020.2988334

Cited by 3 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The maximum number of neighbors for any vertex is ∆, thereby t2 = O(∆). Simulation results in [15] strongly confirm this claim. In each round, every uncolored vertex or at least one of its neighbors acquires a color equal to the round number.…”

Section: Our Algorithm For Graph Coloring Problemsupporting

confidence: 60%

“…In case the graph is composed of some components, an algorithm is independently applied to each component. Furthermore, the communication system is ideal (without noise), and message exchange is error-free [15], which are not realistic assumptions about wireless channels. The main objective is the reduction in the time complexity [1], [9], [11], [12].…”

Section: An Overview On Vertex Coloring Algorithmsmentioning

confidence: 99%

“…By definition, the message/bit complexity of a distributed algorithm is the total number of messages/bits transmitted before it halts. The bit complexity is considered a finer measure of communication complexity and is used as another efficiency metric for the coloring problem [2], [5], [8], [9], [15]. The communication cost usually outweighs the computation cost in distributed networks, so it is ignored in related work [2], [5], [8], [9], [15], [16], [17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient and Robust Distributed Vertex Coloring Algorithm in Wireless Networks

Miri,

Ahmadian,

Hadei

2024

Preprint

View full text Add to dashboard Cite

The distributed vertex coloring is one of the most intensively studied problem in graph theory with many applications in computer networks.We propose a deterministic distributed algorithm for this problem in wireless networks.The algorithm's run-time is divided into rounds.In each round, every uncolored vertex or at least one of its neighbors obtains a color equal to the round number and informs its neighbors of the taken color with a 1-bit message. Therefore, the bit complexity is minimum. Moreover, the set of colored vertices is a maximal independent set (MIS), and the maximum number of colors or rounds equals the maximum number of MISs that cover the graph's vertices. It is bounded by the maximum vertex degree and also the radius of the graph.This is the first algorithm that uses a lower bound on the number of colors for every graph.In the case of trees, the logarithm of the number of vertices is another upper bound for it. Finally, we propose another algorithm for 2-coloring, and the number of rounds is bounded by the diameter of the tree.

show abstract

Section: Our Algorithm For Graph Coloring Problemsupporting

confidence: 60%

Section: An Overview On Vertex Coloring Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient and Robust Distributed Vertex Coloring Algorithm in Wireless Networks

Miri,

Ahmadian,

Hadei

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Efficient graph-based schemes were proposed in [15], [16], which apply the maximal independent set (MIS) concept in graph theory to help divide HetNets into almost interferencefree groups. In [15], a distance threshold was used for indicating whether an edge is directed to the vertex or not.…”

Section: Introductionmentioning

confidence: 99%

“…In [15], a distance threshold was used for indicating whether an edge is directed to the vertex or not. In [16], the scheme is divided into rounds. In each round, vertices compete for colors, and the winning vertices will use the resources in the next round.…”

Section: Introductionmentioning

confidence: 99%

A Fairness-Driven Resource Allocation Scheme Based on a Weighted Interference Graph in HetNets

Agarwal

Togou

Ruffini

et al. 2021

2021 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

View full text Add to dashboard Cite

One of the most important 5G features is their support for heterogeneous networks (HetNets). Complementing the classic macrocell base stations (MBS), femtocell base stations (FBS) are beneficial in terms of extensive coverage, including indoor, and enhancement of capacity. Unfortunately, FBSs performance in 5G HetNets is affected by complex cross-tier and co-tier interferences, causing reduced quality of service (QoS) and unfairness among users. This paper proposes an innovative resource allocation (RA) algorithm for interference mitigation (IM) based on graph coloring techniques to improve QoS and interuser fairness. The proposed algorithm, named Weighted Edge-Weighted Vertex Interference Mitigation (WEWVIM), employs a weight to the directed edge corresponding to the interference strength from nearby base stations (BSs) and a weight to every vertex, indicating the color with the smallest interference or higher transmission rate. A region of interest (ROI) is formed to find the interfering BSs. Simulation results show that WEWVIM outperforms existing schemes in terms of fairness and QoS, including throughput, packet loss ratio (PLR), delay, and jitter.

show abstract

One stride ahead Advancements in Dispersed Graph Coloring

Metkewar

Bokhare

2023

2023 International Conference for Advancement in Technology (ICONAT)

View full text Add to dashboard Cite

DRAGON: A Dynamic Distributed Resource Allocation Algorithm for Wireless Networks

Cited by 3 publications

References 16 publications

An Efficient and Robust Distributed Vertex Coloring Algorithm in Wireless Networks

An Efficient and Robust Distributed Vertex Coloring Algorithm in Wireless Networks

A Fairness-Driven Resource Allocation Scheme Based on a Weighted Interference Graph in HetNets

One stride ahead Advancements in Dispersed Graph Coloring

Contact Info

Product

Resources

About