Selective Family and Broadcasting on Unknown Radio Networks
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 93 === We study the problem of (n,k)-selective family: Let [n] = {1,…,n} and let k < n. A family S of subsets of [n] is an (n,k)-selective family if, for every subset f of [n] such that 1 < | f | < k, there is a set s in S such that . The concept of selectiv...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60708019734012538253 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 93 === We study the problem of (n,k)-selective family: Let [n] = {1,…,n} and let k < n. A family S of subsets of [n] is an (n,k)-selective family if, for every subset f of [n] such that 1 < | f | < k, there is a set s in S such that . The concept of selective family is a commonly used tool for coping with collision on radio networks. We first show that there exists a (n,k)-selective family with O(klog(n/k)) size, and then we design some polynomial time algorithms to find such selective family.
|
|---|