### Abstract

The whitespace-discovery problem describes two parties, Alice and Bob, trying to discovery one another and establish communication over one of a given large segment of communication channels. Subsets of the channels are occupied in each of the local environments surrounding Alice and Bob, as well as in the global environment (Eve). In the absence of a common clock for the two parties, the goal is to devise time-invariant (stationary) strategies minimizing the discovery time. We model the problem as follows. There are N channels, each of which is open (unoccupied) with probability p _{1},p _{2},q independently for Alice, Bob and Eve respectively. Further assume that N ≫ 1/(p _{1} p _{2} q) to allow for sufficiently many open channels. Both Alice and Bob can detect which channels are locally open and every time-slot each of them chooses one such channel for an attempted discovery. One aims for strategies that, with high probability over the environments, guarantee a shortest possible expected discovery time depending only on the p _{i} 's and q. Here we provide a stationary strategy for Alice and Bob with a guaranteed expected discovery time of O(1/(p1p2q ^{2}|)) given that each party also has knowledge of p _{1},p _{2},q. When the parties are oblivious of these probabilities, analogous strategies incur a cost of a poly-log factor, i.e. Õ(1/(p1p2q ^{2}. Furthermore, this performance guarantee is essentially optimal as we show that any stationary strategies of Alice and Bob have an expected discovery time of at least Ω(1/(p1p2q^{2})).

Original language | English (US) |
---|---|

Title of host publication | Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings |

Pages | 713-722 |

Number of pages | 10 |

Volume | 6942 LNCS |

DOIs | |

State | Published - 2011 |

Event | 19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany Duration: Sep 5 2011 → Sep 9 2011 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6942 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 19th Annual European Symposium on Algorithms, ESA 2011 |
---|---|

Country | Germany |

City | Saarbrucken |

Period | 9/5/11 → 9/9/11 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings*(Vol. 6942 LNCS, pp. 713-722). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6942 LNCS). https://doi.org/10.1007/978-3-642-23719-5_60

**Optimal discovery strategies in white space networks.** / Azar, Yossi; Gurel-Gurevich, Ori; Lubetzky, Eyal; Moscibroda, Thomas.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings.*vol. 6942 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6942 LNCS, pp. 713-722, 19th Annual European Symposium on Algorithms, ESA 2011, Saarbrucken, Germany, 9/5/11. https://doi.org/10.1007/978-3-642-23719-5_60

}

TY - GEN

T1 - Optimal discovery strategies in white space networks

AU - Azar, Yossi

AU - Gurel-Gurevich, Ori

AU - Lubetzky, Eyal

AU - Moscibroda, Thomas

PY - 2011

Y1 - 2011

N2 - The whitespace-discovery problem describes two parties, Alice and Bob, trying to discovery one another and establish communication over one of a given large segment of communication channels. Subsets of the channels are occupied in each of the local environments surrounding Alice and Bob, as well as in the global environment (Eve). In the absence of a common clock for the two parties, the goal is to devise time-invariant (stationary) strategies minimizing the discovery time. We model the problem as follows. There are N channels, each of which is open (unoccupied) with probability p 1,p 2,q independently for Alice, Bob and Eve respectively. Further assume that N ≫ 1/(p 1 p 2 q) to allow for sufficiently many open channels. Both Alice and Bob can detect which channels are locally open and every time-slot each of them chooses one such channel for an attempted discovery. One aims for strategies that, with high probability over the environments, guarantee a shortest possible expected discovery time depending only on the p i 's and q. Here we provide a stationary strategy for Alice and Bob with a guaranteed expected discovery time of O(1/(p1p2q 2|)) given that each party also has knowledge of p 1,p 2,q. When the parties are oblivious of these probabilities, analogous strategies incur a cost of a poly-log factor, i.e. Õ(1/(p1p2q 2. Furthermore, this performance guarantee is essentially optimal as we show that any stationary strategies of Alice and Bob have an expected discovery time of at least Ω(1/(p1p2q2)).

AB - The whitespace-discovery problem describes two parties, Alice and Bob, trying to discovery one another and establish communication over one of a given large segment of communication channels. Subsets of the channels are occupied in each of the local environments surrounding Alice and Bob, as well as in the global environment (Eve). In the absence of a common clock for the two parties, the goal is to devise time-invariant (stationary) strategies minimizing the discovery time. We model the problem as follows. There are N channels, each of which is open (unoccupied) with probability p 1,p 2,q independently for Alice, Bob and Eve respectively. Further assume that N ≫ 1/(p 1 p 2 q) to allow for sufficiently many open channels. Both Alice and Bob can detect which channels are locally open and every time-slot each of them chooses one such channel for an attempted discovery. One aims for strategies that, with high probability over the environments, guarantee a shortest possible expected discovery time depending only on the p i 's and q. Here we provide a stationary strategy for Alice and Bob with a guaranteed expected discovery time of O(1/(p1p2q 2|)) given that each party also has knowledge of p 1,p 2,q. When the parties are oblivious of these probabilities, analogous strategies incur a cost of a poly-log factor, i.e. Õ(1/(p1p2q 2. Furthermore, this performance guarantee is essentially optimal as we show that any stationary strategies of Alice and Bob have an expected discovery time of at least Ω(1/(p1p2q2)).

UR - http://www.scopus.com/inward/record.url?scp=80052818708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052818708&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23719-5_60

DO - 10.1007/978-3-642-23719-5_60

M3 - Conference contribution

SN - 9783642237188

VL - 6942 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 713

EP - 722

BT - Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings

ER -