ConflictGraph.h Source File¶

Simu5G: ConflictGraph.h Source File
Simu5G
//
//                  Simu5G
//
// Copyright (C) 2012-2021 Giovanni Nardini, Giovanni Stea, Antonio Virdis et al. (University of Pisa)
// Copyright (C) 2022-2026 Giovanni Nardini, Giovanni Stea et al. (University of Pisa)
//
// This file is part of a software released under the license included in file
// "license.pdf". Please read LICENSE and README files before using it.
// The above files and the present reference are part of the software itself,
// and cannot be removed from it.
//
 
#ifndef CONFLICTGRAPH_H
#define CONFLICTGRAPH_H
 
#include "simu5g/stack/mac/LteMacEnb.h"
#include "simu5g/common/cellInfo/CellInfo.h"
 
namespace simu5g {
 
using namespace omnetpp;
 
enum CGType
{
    CG_DISTANCE,
    CG_UNKNOWN
};
 
/*
 * Define the structure for graph vertices
 */
struct CGVertex
{
    MacNodeId srcId;
    MacNodeId dstId;
 
    bool operator<(const CGVertex& v1) const
    {
        if (srcId < v1.srcId)
            return true;
        if ((srcId == v1.srcId) && (dstId < v1.dstId))
            return true;
        return false;
    }
 
    bool operator==(const CGVertex& v1) const
    {
        return (srcId == v1.srcId) && (dstId == v1.dstId);
    }
 
  public:
    CGVertex(MacNodeId src = NODEID_NONE, MacNodeId dst = NODEID_NONE) : srcId(src), dstId(dst)
    {
    }
 
    bool isMulticast() const
    {
        return dstId == NODEID_NONE;
    }
 
};
 
inline std::ostream& operator<<(std::ostream& os, const CGVertex& v)
{
    os << "src=" << v.srcId << " dst=" << v.dstId;
    return os;
}
 
typedef std::map<CGVertex, std::map<CGVertex, bool>> CGMatrix;
class CellInfo;
class LteMacEnb;
class ConflictGraph
{
 
  protected:
    opp_component_ptr<Binder> binder_;
 
    // Reference to the MAC layer
    opp_component_ptr<LteMacEnb> macEnb_;
 
    // Reference to the CellInfo
    opp_component_ptr<CellInfo> cellInfo_;
 
    // Conflict Graph
    CGMatrix conflictGraph_;
 
    // flag for enabling/disabling sharing models
    bool reuseD2D_;
    bool reuseD2DMulti_;
 
    // reset Conflict Graph
    virtual void clearConflictGraph();
 
    virtual void findVertices(std::vector<CGVertex>& vertices) = 0;
    virtual void findEdges(const std::vector<CGVertex>& vertices) = 0;
 
  public:
 
    ConflictGraph(Binder *binder, LteMacEnb *macEnb, bool reuseD2D, bool reuseD2DMulti);
 
    virtual ~ConflictGraph() {}
 
    // compute Conflict Graph
    virtual void computeConflictGraph();
 
    // print Conflict Graph - for debug
    virtual void printConflictGraph();
 
    const CGMatrix *getConflictMatrix() const { return &conflictGraph_; }
};
 
} //namespace
 
#endif /* CONFLICTGRAPH_H */
 