Filters








165,267 Hits in 4.4 sec

Random Order Contention Resolution Schemes [article]

Marek Adamczyk, Michał Włodarczyk
2018 arXiv   pre-print
We add to this line of work by showing how to create contention resolution schemes for intersection of matroids and knapsacks when we work in the random order setting.  ...  Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems.  ...  The left side of property (b) follows from Theorem 10 . 1 . 101 There exists a random-order CR scheme for a bounded knapsack with c = 1 3 .Algorithm 7 Random order contention resolution scheme for a  ... 
arXiv:1804.02584v3 fatcat:5avpg3het5hx3blclbowjxilhe

Multi-dimensional mechanism design via random order contention resolution schemes

Marek Adamczyk, Michał Włodarczyk
2020 ACM SIGecom Exchanges  
We add to this line of work by considering the Contention Resolution Scheme framework in the random order setting.  ...  Second, Feldman, Svensson and Zenklusen in 2016 adapted the Contention Resolution Scheme framework for online settings.  ...  The whole procedure is presented in Algorithm 1 Algorithm 1 Random order contention resolution scheme for a single matroid 1: Given: matroid M, x ∈ P [M], and a random set R (x) such that P [e ∈ R (x)]  ... 
doi:10.1145/3381329.3381334 fatcat:uqh7sjhjarfeplrjryyvtl4thu

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications

Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang, Nikhil Bansal, Emanuela Merelli, James Worrell
2021
In this paper, we study the random order vertex arrival contention resolution scheme for matching in general graphs, which is inspired by the recent work of Ezra et al. (EC 2020).  ...  Our results are the first non-trivial results for random order prophet matching and Price-of-Information matching in general graphs.  ...  between correlation gap and contention resolution scheme.  ... 
doi:10.4230/lipics.icalp.2021.68 fatcat:bw6jogkprvbgddgm2ad7pplhya

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem

Shaddin Dughmi, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
Second, we reduce the matroid secretary problem to the design of an online contention resolution scheme of a particular form.  ...  For the online random arrival model, we show that contention resolution is intimately tied to the secretary problem via two results.  ...  We restricted our attention to matroids in the paper, though some notes are in order on extensions of our results to more general constraints.  ... 
doi:10.4230/lipics.icalp.2020.42 dblp:conf/icalp/Dughmi20 fatcat:pr6pnfkv6fcufkqg74fklynrha

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem [article]

Shaddin Dughmi
2020 arXiv   pre-print
Second, we reduce the matroid secretary problem to the design of an online contention resolution scheme of a particular form.  ...  For the online random arrival model, we show that contention resolution is intimately tied to the secretary problem via two results.  ...  Additional Discussion of Related Work Contention Resolution Schemes Contention resolution schemes were introduced by Chekuri et al.  ... 
arXiv:1909.04268v3 fatcat:2nxtnxvznzbirkggckkwnkv33y

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes [article]

Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2022 arXiv   pre-print
We present new ordered contention resolution schemes yielding improved approximation guarantees for some of the foundational problems studied in this area.  ...  When the vertices do not have patience constraints, we describe a 0.432-approximate random order probing algorithm with several corollaries such as an improved guarantee for the Prophet Secretary problem  ...  Using our attenuation for Random-order Contention Resolution Schemes.  ... 
arXiv:2106.06892v2 fatcat:2yi5r75tmvaqfm75ped5m6tkji

Transient Coordinator: a Collision Resolution Algorithm for Asynchronous MAC Protocols in Wireless Sensor Networks

Sang Hoon Lee
2012 KSII Transactions on Internet and Information Systems  
This demonstrates that TC is more efficient in terms of performance, resource utilization, and energy compared to the random back-off scheme in dealing with collisions for asynchronous WSN MAC scheduling  ...  TC resolves a collision on demand by ordering senders' transmissions when a receiver detects a collision.  ...  In the random back-off technique each node retries the packet transmission by backing off a random value which is lower than the contention window size.  ... 
doi:10.3837/tiis.2012.12.007 fatcat:focl3o5nynbqjjxjp5ghcl5jkq

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy

Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc
2022 Proceedings of the 23rd ACM Conference on Economics and Computation  
In a contention resolution scheme (CRS) for matching, each edge 𝑒 ∈ 𝐸 is active independently with probability 𝑥 𝑒 , where {𝑥 𝑒 } 𝑒 ∈𝐸 ∈ P (𝐺).  ...  Our results tie into the literature on contention resolution schemes [3], which we briefly define. Let P (𝐺) denote the fractional matching polytope of a graph 𝐺 = (𝑉 , 𝐸).  ...  We reduce the problem of 𝑐-approximating the sequential pricing problem to giving a 𝑐-balanced Random-Order Online Contention Resolution Scheme (RO-OCRS) for matching.  ... 
doi:10.1145/3490486.3538295 fatcat:rqyv6uv5hnhghcud2y7lvwmtma

Explicit and implicit pipelining for wireless medium access control

Xue Yang, N.H. Vaidya
2003 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)  
With distributed multiple access control, each station usually goes through a contention resolution stage before initiating its transmission.  ...  For this reason, more efficient contention resolution algorithms are desired for wireless networks to reduce the collision probability among backlogged stations.  ...  The authors would like to thank Vaduvur Bharghavan for the discussions on "Total Pipelining" scheme, and thank Romit Roy Choudhury, Pradeep Kyasanur and Matt Miller for their suggestions on the paper.  ... 
doi:10.1109/vetecf.2003.1285260 fatcat:h6pmuwkotnbdnbhgxuokzqzzhq

Contention-Based Geographic Forwarding Strategies for Wireless Sensors Networks

Carlos H. M. de Lima, Pedro H. J. Nardelli, Hirley Alves, Matti Latva-aho
2016 IEEE Sensors Journal  
The investigated strategies are built upon three constituent parts: 1) relay selection algorithm; 2) contention resolution mechanism; and 3) geographic forwarding strategy.  ...  In order to design and assess such contention-based geographic forwarding strategies, we establish an analytical framework that incorporates concepts from probability generating functions (through power  ...  As aforesaid, the probability generating function of the contention resolution interval is determined in order to characterize the relay selection cost.  ... 
doi:10.1109/jsen.2015.2509778 fatcat:gebumuo7travheaecad6uzsdmq

A Simple and Tight Greedy OCRS [article]

Vasilis Livanos
2021 arXiv   pre-print
When one does not have any control on the order of rounding, Online Contention Resolution Schemes (OCRSs) can be used instead, and have been successfully applied in settings such as prophet inequalities  ...  In recent years, Contention Resolution Schemes (CRSs), introduced by Chekuri, Vondrák, and Zenklusen, have emerged as a general framework for obtaining feasible solutions to combinatorial optimization  ...  A scheme is called a Random Order Contention Resolution Schemes (ROCRS) if, instead of being chosen by an adversary, the arrival order of the elements is chosen uniformly at random.  ... 
arXiv:2111.13253v2 fatcat:zlh5kn5bdzdprexjlr3flt3d5y

Harmony: Content resolution for smart devices using acoustic channel

Mostafa Uddin, Tamer Nadeem
2015 2015 IEEE Conference on Computer Communications (INFOCOM)  
Harmony uses the acoustic channel for contention resolution in Wi-Fi networks.  ...  In this paper, we utilize a novel communication framework Acoustic-WiFi to develop a smart contention resolution scheme Harmony among the contending devices to address the overhead of the traditional Wi-Fi  ...  Contention Resolution: The idea of backoff scheme to resolve the contention in wireless medium is not new [7] .  ... 
doi:10.1109/infocom.2015.7218604 dblp:conf/infocom/UddinN15 fatcat:5pr7wumavbc57euaowk3clautq

Combining forward error correction and network coding in bufferless networks: A case study for optical packet switching

Gergely Biczok, Yanling Chen, Katina Kralevska, Harald Overby
2016 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)  
The main challenge with zero buffers is the avoidance or handling of contention; indeed, many domain-specific contention resolution techniques have been proposed in the literature.  ...  In this paper, we propose a generic combined forward error correction (FEC) and network coding (NC) scheme, which mitigates the negative impact of contentions at the network layer.  ...  On the one hand, electronic FEC can be combined with any contention resolution scheme operating in the OPS core.  ... 
doi:10.1109/hpsr.2016.7525640 dblp:conf/hpsr/BiczokCKO16 fatcat:frqiskd2xbfwvdqe6lme7gnkvi

Identification of Error-Capturing Scan Cells in Scan-BIST With Applications to System-on-Chip

C. Liu, K. Chakrabarty
2004 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Two-step partitioning provides higher diagnostic resolution than previous schemes that rely either on random-selection partitioning or deterministic partitioning.  ...  In the second step, additional partitions are created using a previously proposed random-selection partitioning method.  ...  that are consecutively ordered in the scan chain.  ... 
doi:10.1109/tcad.2004.833620 fatcat:ocy5vziasjetljqc56szefajfm

Secure Key Management for Flexible Digital Rights Management of Scalable Codestreams

Bin Zhu, Min Feng, Shipeng Li
2005 2005 IEEE 7th Workshop on Multimedia Signal Processing  
We first present an efficient partially ordered set (poset) to represent scalable access control so that any access control schemes for a poset can be applied and a single secret key is needed to transfer  ...  We then present a secure key scheme modifiedfrom our previous scalable access key scheme for the resulting poset. The key scheme is based on the group Diffie-Hellman key agreement, and is secure.  ...  Then the 2 resolutions and 2 layers form fully ordered sets, while the 3 tiles form a poset.  ... 
doi:10.1109/mmsp.2005.248617 dblp:conf/mmsp/ZhuFL05 fatcat:hf4n4scpuvgsrggubkfdxzv2lu
« Previous Showing results 1 — 15 out of 165,267 results