Information exchange with collision detection on multiple channels

Wang, Yuepeng; Wang, Yuexuan; Yu, Dongxiao; Yu, Jiguo; Lau, Francis C. M.

doi:10.1007/s10878-014-9713-5

Cited by 14 publications

(8 citation statements)

References 20 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In some sense, some parts of our algorithms can be seen as derandomized versions of the ideas presented in [20]. Wang et al [23] considered the same setting as [20] but assume collisions can be detected. In this setting they achieve a runtime of O(k + log 2 n F + log n) using F channels.…”

Section: Related Workmentioning

confidence: 99%

Deterministic multi-channel information exchange

Holzer

Locher

Pignolet

et al. 2017

Journal of Computer and System Sciences

View full text Add to dashboard Cite

We study the information exchange problem on a set of multiple access channels: k arbitrary nodes have information they want to distribute to the entire network of n nodes via a shared medium partitioned into channels. We devise a deterministic algorithm running in asymptotically optimal time O(k) using O(n log(k)/k) channels if k ≤ 1 6 log n and O(log 1+ρ (n/k)) channels otherwise, where ρ > 0 is an arbitrarily small constant. This is a super-polynomial improvement over the best known bounds [20]. Additionally we show that our results are significantly closer to the optimal solution by proving that Ω(n Ω(1/k) + log k n) channels are necessary to achieve a time complexity of O(k).

show abstract

Section: Related Workmentioning

confidence: 99%

Deterministic multi-channel information exchange

Holzer

Locher

Pignolet

et al. 2017

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…Among them, layer-based method FCM algorithm is common. The FCM algorithm [10] uses fuzzy logic where each data point is specified by a membership grade between 0 and 1. However, there are still some defects: (1) its performance relies on initialization of parameters; (2) it consumes a lot of time when data size is large.…”

Section: Introductionmentioning

confidence: 99%

An Improved Clustering Method for Detection System of Public Security Events Based on Genetic Algorithm and Semisupervised Learning

et al. 2017

View full text Add to dashboard Cite

The occurrence of series of events is always associated with the news report, social network, and Internet media. In this paper, a detecting system for public security events is designed, which carries out clustering operation to cluster relevant text data, in order to benefit relevant departments by evaluation and handling. Firstly, texts are mapped into three-dimensional space using the vector space model. Then, to overcome the shortcoming of the traditional clustering algorithm, an improved fuzzy -means (FCM) algorithm based on adaptive genetic algorithm and semisupervised learning is proposed. In the proposed algorithm, adaptive genetic algorithm is employed to select optimal initial clustering centers. Meanwhile, motivated by semisupervised learning, guiding effect of prior knowledge is used to accelerate iterative process. Finally, simulation experiments are conducted from two aspects of qualitative analysis and quantitative analysis, which demonstrate that the proposed algorithm performs excellently in improving clustering centers, clustering results, and consuming time.

show abstract

“…This time bound O(ℓ) is optimal when multiple rumors cannot be combined into compound messages. Wang et al [48] considered information-exchange in a model when rumors can be combined into compound messages and collision detection is available. They gave an algorithm of time performance O(ℓ/b + n log 2 n), for ℓ rumors and b channels.…”

Section: Introductionmentioning

confidence: 99%

Scalable wake-up of multi-channel single-hop radio networks

Chlebus

Marco

Kowalski

2016

Theoretical Computer Science

View full text Add to dashboard Cite

We consider single-hop radio networks with multiple channels as a model of wireless networks. There are n stations connected to b radio channels that do not provide collision detection. A station uses all the channels concurrently and independently. Some k stations may become active spontaneously at arbitrary times. The goal is to wake up the network, which occurs when all the stations hear a successful transmission on some channel. Duration of a waking-up execution is measured starting from the first spontaneous activation. We present a deterministic algorithm for the general problem that wakes up the network in O(k log 1/b k log n) time, where k is unknown. We give a deterministic scalable algorithm for the special case when b > d log log n, for some constant d > 1, which wakes up the network in O( k b log n log(b log n)) time, with k unknown. This algorithm misses time optimality by at most a factor of O(log n(log b+log log n)), because any deterministic algorithm requires Ω( k b log n k ) time. We give a randomized algorithm that wakes up the network within O(k 1/b ln 1 ǫ ) rounds with a probability that is at least 1 − ǫ, for any 0 < ǫ < 1, where k is known. We also consider a model of jamming, in which each channel in any round may be jammed to prevent a successful transmission, which happens with some known parameter probability p, independently across all channels and rounds. For this model, we give two deterministic algorithms for unknown k: one wakes up the network in time O(log −1 ( 1 p ) k log n log 1/b k), and the other in time O(log −1 ( 1 p ) k b log n log(b log n)) but assuming the inequality b > log(128b log n), both with a probability that is at least 1 − 1/poly(n).

show abstract

Information exchange with collision detection on multiple channels

Cited by 14 publications

References 20 publications

Deterministic multi-channel information exchange

Deterministic multi-channel information exchange

An Improved Clustering Method for Detection System of Public Security Events Based on Genetic Algorithm and Semisupervised Learning

Scalable wake-up of multi-channel single-hop radio networks

Contact Info

Product

Resources

About