Name
Abstract | ||
|---|---|---|
We propose a dynamic distributed resource allocation algorithm for wireless networks, where the resources allocated to adjacent nodes (vertices) must be different and the topology of the network (graph) may change. Time is divided into rounds. In each round, a maximal independent set (MIS) is found, and the vertices in the MIS will use the resource in the next round. Therefore, the resource reuse equals the expected value of sizes of MISs, and we present two lower bounds for it. The number of messages transmitted by each vertex included/excluded in the MIS is one/zero, and messages are 1-bit. Therefore, the independence number of the graph is an upper bound for the number of bits transmitted in a round. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/LCOMM.2020.2988334 | IEEE Communications Letters |
Keywords | DocType | Volume |
Bit complexity,maximal independent set,resource allocation,resource reuse,vertex coloring problem | Journal | 24 |
Issue | ISSN | Citations |
8 | 1089-7798 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammadhasan Miri | 1 | 0 | 0.34 |
| Yousef Darmani | 2 | 5 | 3.14 |
| Kamal Mohamed-Pour | 3 | 32 | 12.38 |
| Mehdi Yaghoubi | 4 | 0 | 0.34 |
| Mahasweta Sarkar | 5 | 132 | 17.10 |