Multipath Stability Routing in Cognitive UAV Swarm for Emergency Communications: A Hypergraph Matching Approach

Algorithm 1

Greedy Algorithm.

Input: Stability

Output: The selected initialization set

1: Transform the original hypergraph into a feasible hypergraph.

2: Transform the feasible hypergraph into a conflict graph.

3: Generate conflict graph with vertex set based on .

4: Set .

5: whiledo

6: Select a vertex with maximum-weight of vertex in .

7: Set . Find all the adjacent vertices of . And let be the set of adjacent vertices of .

8: Set and

9: end while