Results 1  10
of
21,436
Faster Deterministic Broadcasting in ad hoc Radio Networks
 Proc. 20th Ann. Symp. on Theor. Aspects of Comp. Sci. (STACSâ€™2003), LNCS 2607
, 2003
"... We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcastin ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic
Efficient Distributed Communication in AdHoc Radio Networks
, 2011
"... We present new distributed deterministic solutions to two communication problems in nnode adhoc radio networks: rumor gathering and multibroadcast. In these problems, some or all nodes of the network initially contain input data called rumors, which have to be learned by other nodes. In rumor ga ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present new distributed deterministic solutions to two communication problems in nnode adhoc radio networks: rumor gathering and multibroadcast. In these problems, some or all nodes of the network initially contain input data called rumors, which have to be learned by other nodes. In rumor
Deterministic Broadcasting in Ad Hoc Radio Networks
, 2002
"... We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
node is limited to its own label. Such networks are called ad hoc multihop networks. We study the time of deterministic broadcasting under this scenario. For the model without collision detection, we develop a lineartime broadcasting algorithm for symmetric graphs, which is optimal
Oblivious Gossiping in AdHoc Radio Networks
 In Proc. of 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALMâ€™2001
, 2001
"... We study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. In oblivious algorithms the fact (or probability in case of randomized algorithm) that a processor transmits or not at a given timestep depends solely on its identification number, the total number o ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. In oblivious algorithms the fact (or probability in case of randomized algorithm) that a processor transmits or not at a given timestep depends solely on its identification number, the total number
Acknowledged Broadcasting and Gossiping in ad hoc radio networks
"... Abstract. A radio network is a collection of transmitterreceiver devices (referred to as nodes). ARB (Acknowledged Radio Broadcasting) means transmitting a message from one special node called source to all the nodes and informing the source about its completion. In our model each node takes a sync ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. A radio network is a collection of transmitterreceiver devices (referred to as nodes). ARB (Acknowledged Radio Broadcasting) means transmitting a message from one special node called source to all the nodes and informing the source about its completion. In our model each node takes a
Broadcasting in Undirected Ad hoc Radio Networks
"... ABSTRACT We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D)+log2 n) in ..."
Abstract
 Add to MetaCart
ABSTRACT We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time O(D log(n/D)+log2 n
Faster deterministic gossiping in directed adhoc radio networks
 In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory
, 2004
"... Abstract. We study the gossiping problem in directed adhoc radio networks. Our main result is a deterministic algorithm that solves this problem in an nnode network in time O(n 4/3 log 4 n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
Abstract. We study the gossiping problem in directed adhoc radio networks. Our main result is a deterministic algorithm that solves this problem in an nnode network in time O(n 4/3 log 4 n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based
Fast Message Dissemination in Random Geometric AdHoc Radio Networks
, 2007
"... We study the complexity of distributed protocols for the classical information dissemination problem of distributed gossiping. We consider the model of random geometric networks, one of the main models used to study properties of sensor and adhoc networks, where n points are randomly placed in a un ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
unit square and two points are connected by an edge/link if they are at at most a certain fixed distance r from each other. To study communication in the network, we consider the adhoc radio networks model of communication. We examine various scenarios depending on the local knowledge of each node
On the Approximation Ratio of the MSTbased Heuristic for the EnergyEfficient Broadcast Problem in Static AdHoc Radio Networks
 Problem in Static AdHoc Radio Networks. Int. Parallel and Distributed Processing Sympos. (IPDPS
, 2003
"... We present a new analysis of the approximation ratio of the MSTbased heuristic [1] for the Minimum Energy Broadcast Problem in AdHoc Radio Networks. ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We present a new analysis of the approximation ratio of the MSTbased heuristic [1] for the Minimum Energy Broadcast Problem in AdHoc Radio Networks.
Results 1  10
of
21,436