An interference graph has one graph vertex for each station and an edge for every pair that cannot transmit simultaneously. Feasible activation schedules are the graph's independent sets.
For feasible independent set activation vectors , the throughput region is their convex hull. Its downward closure is the same set because deleting active vertices preserves feasibility. Ideal carrier-sense multiple access can supply strict margins above every vector in its interior by adjusting attempt rates.
Articles by others on the same topic
There are currently no matching articles.