ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1510.07357
12
1
v1v2v3 (latest)

Distributed Bare-Bones Communication in Wireless Networks

26 October 2015
Bogdan S. Chlebus
Dariusz R. Kowalski
Shailesh Vaya
ArXiv (abs)PDFHTML
Abstract

We consider wireless networks with the SINR model of interference when nodes have very limited individual knowledge and capabilities. In particular, nodes do not know their geographic coordinates and their neighborhoods, nor even the size nnn of the network, nor can they sense collisions. Each node is equipped only with a unique integer name, where NNN is an upper bound on their range. We study distributed algorithms for communication problems in the following three settings. In the single-node-start case, when one node starts an execution and the other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm which wakes up all the nodes in O(nlog⁡2N)O(n \log^2 N)O(nlog2N) rounds with high probability. Let Δ\DeltaΔ denote the maximum number of nodes that successfully receive a message transmitted by a node when no other nodes transmit. For the synchronized-start case, when all the nodes start an execution simultaneously, we give a randomized algorithm that computes a backbone of the network in O(Δlog⁡7N)O(\Delta\log^{7} N)O(Δlog7N) rounds with high probability. Finally, in the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone network in time O(nlog⁡2N+Δlog⁡7N)O(n\log^2 N +\Delta\log^{7} N)O(nlog2N+Δlog7N) with high probability.

View on arXiv
Comments on this paper