Results 1  10
of
11
Bounds on Contention Management in Radio Networks
"... Abstract. The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two wellstudied wireless network models: the classical model, in which links are ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two wellstudied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive. 1
Efficient Distributed MultipleMessage Broadcasting in Unstructured Wireless Networks
"... Abstract—Multiplemessage broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured w ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Multiplemessage broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured wireless networks under the physical interference model (also known as the SINR model). The unstructured wireless network assumes unknown network topology, no collision detection and asynchronous communications. Our proposed randomized distributed algorithm can accomplish multiplemessage broadcast in O((D + k) log n + log 2 n) timeslots with high probability, where D is the network diameter and n is the number of nodes in the network. To our best knowledge, this work is the first one to consider distributively implementing multiplemessage broadcasting in unstructured wireless networks under a global interference model, which may shed some light on how to efficiently solve in general a “global ” problem in a “local ” fashion with “global ” interference constraints in asynchronous wireless ad hoc networks. Apart from the algorithm, we also show an Ω(D+k+log n) lower bound for randomized distributed multiple message broadcast algorithms under the assumed network model. I.
Distributed deterministic broadcasting in uniformpower ad hoc wireless networks
, 2013
"... ar ..."
(Show Context)
The Cost of Radio Network Broadcast for Different Models of Unreliable Links∗
"... We study upper and lower bounds for the global and local broadcast problems in the dual graph model combined with different strength adversaries. The dual graph model is a generalization of the standard graphbased radio network model that includes unreliable links controlled by an adversary. It i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
We study upper and lower bounds for the global and local broadcast problems in the dual graph model combined with different strength adversaries. The dual graph model is a generalization of the standard graphbased radio network model that includes unreliable links controlled by an adversary. It is motivated by the ubiquity of unreliable links in real wireless networks. Existing results in this model [11, 12, 3, 8] assume an offline adaptive adversary—the strongest type of adversary considered in standard randomized analysis. In this paper, we study the two other standard types of adversaries: online adaptive and oblivious. Our goal is to find a model that captures the unpredictable behavior of real networks while still allowing for efficient broadcast solutions.
Distributed deterministic broadcasting in wireless networks under the sinr model
, 2012
"... ar ..."
(Show Context)
Models
 in UNESCO (ed.) Scientific Thought. Some Underlying Concepts, Methods, and Procedures, Mouton/UNESCO
, 1972
"... ar ..."
Maximal independent sets in multichannel radio networks
, 2013
"... We present new upper bounds for fundamental problems in multichannel wireless networks. These bounds address the benefits of dynamic spectrum access, i.e., to what extent multiple communication channels can be used to improve performance. In more detail, we study a multichannel generalization of t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We present new upper bounds for fundamental problems in multichannel wireless networks. These bounds address the benefits of dynamic spectrum access, i.e., to what extent multiple communication channels can be used to improve performance. In more detail, we study a multichannel generalization of the standard graphbased wireless model without collision detection, and assume the network topology satisfies polynomially bounded independence. Our core technical result is an algorithm that constructs a maximal independent set (MIS) in O log2 n
Electing a Leader in MultiHop Radio Networks
"... We consider the task of electing a leader in a distributed manner in ad hoc multihop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network’s topology can be represented by a simple undirected graph with some n nodes, and t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We consider the task of electing a leader in a distributed manner in ad hoc multihop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network’s topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log 3/2 n √ log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log 3/2 n √ log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm.