Disk Graphs: A Short Survey

Fishkin, Aleksei V.

doi:10.1007/978-3-540-24592-6_23

Cited by 27 publications

(20 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The resulting collision graph is called a disk graph [26]: an indirect edge links nodes x and y if x is within the interference range of y or, vice versa, if y is within the interference range of x. In this case, nodes x and y collide when transmitting at the same time.…”

Section: Disk Graph Modelmentioning

confidence: 99%

Trade-off between maximum cardinality of collision sets and accuracy of RFID reader-to-reader collision detection

et al. 2013

View full text Add to dashboard Cite

As the adoption of the radio-frequency identification (RFID) technology is increasing, many applications require a dense reader deployment. In such environments, reader-to-reader interference becomes a critical problem, so the proposal of effective anti-collision algorithms and their analysis are particularly important. Existing reader-to-reader anti-collision algorithms are typically analyzed using single interference models that consider only direct collisions. The additive interference models, which consider the sum of interferences, are more accurate but require more computational effort. The goal of this paper is to find the difference in accuracy between single and additive interference models and how many interference components should be considered in additive models. An in-depth analysis evaluates to which extent the number of the additive components in a possible collision affects the accuracy of collision detection. The results of the investigation shows that an analysis limited to direct collisions cannot reach a satisfactory accuracy, but the collisions generated by the addition of the interferences from a large number of readers do not affect significantly the detection of RFID reader-to-reader collisions.

show abstract

Section: Disk Graph Modelmentioning

confidence: 99%

Trade-off between maximum cardinality of collision sets and accuracy of RFID reader-to-reader collision detection

et al. 2013

View full text Add to dashboard Cite

show abstract

“…In particular, Erlebach et al [9] provide a PTAS for the weighted independent set problem in disk graphs. A short survey on disk graphs can be found in [10] .…”

Section: Related Workmentioning

confidence: 99%

“…,(9),(10),(11) , and (13) , respectively.Note that a problem instance of size n in the SINR model istransformed into a problem instance of size n × |T | in the disk model. This increase in problem size adds extra computation cost, but we will show that a solution to the MWIS problem in this new model results in a correct solution in the SINR model.…”

mentioning

confidence: 98%

Wireless scheduling with multiple data rates: From physical interference to disk graphs

Goussevskaia

Vieira

2016

Computer Networks

View full text Add to dashboard Cite

“…In particular, Erlebach et al [3] develop a PTAS for the maximum weighted independent set (MWIS) problem in disk graphs. A brief survey on algorithmic results for UDGs and disk graphs can be found in [6].…”

Section: Related Workmentioning

confidence: 99%

Data-rate maximization in wireless communication networks

Goussevskaia¹,

Vieira²,

Vieira³

2013

2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

Despite great effort from the research community, wireless networks still operate below full capacity. To increase the network throughput it is important to study algorithms that select communication requests that can decode their signals despite mutual interference. In this paper, we study the joint problem of data rate assignment and link scheduling in the physical interference model. The objective of the problem is to maximize the total number of bits transmitted in one time slot. By constructing an intermediate network representation through a disk graph, we prove that a constant approximation solution can be computed in polynomial time. Finally, we propose a parallel implementation of a polynomial-time approximation scheme and show through simulations that the one-slot throughput of a wireless network can be significantly improved by using variable data rates.

show abstract

Disk Graphs: A Short Survey

Cited by 27 publications

References 15 publications

Trade-off between maximum cardinality of collision sets and accuracy of RFID reader-to-reader collision detection

Trade-off between maximum cardinality of collision sets and accuracy of RFID reader-to-reader collision detection

Wireless scheduling with multiple data rates: From physical interference to disk graphs

Data-rate maximization in wireless communication networks

Contact Info

Product

Resources

About