Results 1  10
of
843
Interference Graphs of Programs in SSAform
"... Register allocation is the task of mapping the variables in a program to processor registers. This problem is often reduced to coloring the socalled interference graph which the compiler computes from the input program. Theoretically, for each undirected graph there is a program having that graph a ..."
Abstract
 Add to MetaCart
Register allocation is the task of mapping the variables in a program to processor registers. This problem is often reduced to coloring the socalled interference graph which the compiler computes from the input program. Theoretically, for each undirected graph there is a program having that graph
How to Build an Interference Graph
, 1988
"... This paper examines the tradeoffs between these two approaches ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
This paper examines the tradeoffs between these two approaches
1 Learning the Interference Graph of a Wireless Network
, 1208
"... Abstract—A key challenge in wireless networking is the management of interference between transmissions. Identifying which transmitters interfere with each other is a crucial first step. Complicating the task is the fact that the topology of wireless networks changes with time, and so identification ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
/Collision Avoidance) protocol, although our model is more general. We cast the task of estimating the interference environment as a graph learning problem. Nodes represent transmitters and edges represent the presence of interference between pairs of transmitters. We passively observe network traffic transmission
Interference GraphBased ResourceSharing Schemes for Vehicular Networks
, 2012
"... Abstract—This paper investigates the resourcesharing problem in vehicular networks, including both vehicletovehicle (V2V) and vehicletoinfrastructure (V2I) communication links. A novel underlaying resourcesharing communication mode for vehicular networks is proposed, in which different V2V and ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
and V2I communication links are permitted to access the same resources for their individual data transmission. To solve the resourcesharing problem in vehicular networks, we, for the first time, apply graph theory and propose the following two interference graphbased resourcesharing schemes: 1
Clique Number Vs. Chromatic Number in Wireless Interference Graphs: Simulation Results
, 2007
"... Abstract Interference due to transmissions by adjacent nodes in a multihop wireless network can be modeled using a Unit Disc Graph (UDG). We investigate the reliability associated with using the clique number instead of the chromatic number of the UDG while computing the interference. In our exten ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract Interference due to transmissions by adjacent nodes in a multihop wireless network can be modeled using a Unit Disc Graph (UDG). We investigate the reliability associated with using the clique number instead of the chromatic number of the UDG while computing the interference. In our
Scheduling constraints and interference graph properties for graphbased interference coordination in cellular OFDMA networks
 Springer Journal on Mobile Networks and Applications
, 2009
"... AbstractThe currently emerging 802.16e (WiMAX) and 3GPP Long Term Evolution (LTE) cellular systems are based on Orthogonal Frequency Division Multiple Access (OFDMA). OFDMA suffers from heavy intercell interference if neighboring base stations use the same frequency range. One approach to solve t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
this issue is the application of beamforming antennas in combination with interference coordination (IFCO) mechanisms between base stations. In this paper, we trace the problem of IFCO back to the graph coloring problem and investigate the achievable resource utilization of the interference coordinated
Topology Control in Wireless Ad Hoc and Sensor Networks
 ACM Computing Surveys
, 2005
"... Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of thi ..."
Abstract

Cited by 304 (4 self)
 Add to MetaCart
of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes ’ transmitting range
Stochastic Geometry and Random Graphs for the Analysis and Design of Wireless Networks
"... Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communicationtheoretic results accoun ..."
Abstract

Cited by 240 (42 self)
 Add to MetaCart
Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communicationtheoretic results
Interference in Graphs
"... Given a graph I = (V, E), ∅ = D ⊆ V, and an arbitrary nonempty set X, an injective function f: V → 2X \ {∅} is an interference of D with respect to I, if for every vertex u ∈ V \ D there exists a neighbor v ∈ D such that f(u) ∩ f(v) = ∅. We initiate a study of interference in graphs. We study ..."
Abstract
 Add to MetaCart
Given a graph I = (V, E), ∅ = D ⊆ V, and an arbitrary nonempty set X, an injective function f: V → 2X \ {∅} is an interference of D with respect to I, if for every vertex u ∈ V \ D there exists a neighbor v ∈ D such that f(u) ∩ f(v) = ∅. We initiate a study of interference in graphs. We study
Results 1  10
of
843