Distributed time-optimal scheduling for convergecast in wireless sensor networks
We consider applications of sensor networks wherein data packets generated by every node
have to reach the base station. This results in a many-to-one communication paradigm …
have to reach the base station. This results in a many-to-one communication paradigm …
Faster communication in known topology radio networks
This paper concerns the communication primitives of broadcasting (one-to-all
communication) and gossiping (all-to-all communication) in radio networks with known …
communication) and gossiping (all-to-all communication) in radio networks with known …
Two space saving tricks for linear time LCP array computation
G Manzini - Scandinavian Workshop on Algorithm Theory, 2004 - Springer
In this paper we consider the linear time algorithm of Kasai et al.[6] for the computation of the
Longest Common Prefix (LCP) array given the text and the suffix array. We show that this …
Longest Common Prefix (LCP) array given the text and the suffix array. We show that this …
Randomized broadcast in radio networks with collision detection
M Ghaffari, B Haeupler, M Khabbazian - … of the 2013 ACM symposium on …, 2013 - dl.acm.org
We present a randomized distributed algorithm that in radio networks with collision detection
broadcasts a single message in O (D+ log6 n) rounds, with high probability. This time …
broadcasts a single message in O (D+ log6 n) rounds, with high probability. This time …
Distributed minimal time convergecast scheduling in wireless sensor networks
We consider applications of sensor networks wherein data packets generated by every node
have to reach the base station. This results in a many-to-one communication paradigm …
have to reach the base station. This results in a many-to-one communication paradigm …
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
A Kesselman, D Kowalski - Second Annual Conference on …, 2005 - ieeexplore.ieee.org
Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider
geometric networks, where nodes are located in a euclidean plane. We assume that each …
geometric networks, where nodes are located in a euclidean plane. We assume that each …
Hardness and approximation of gathering in static radio networks
In this paper, we address the problem of gathering information in a specific node (or sink) of
a radio network, where interference constraints are present. We take into account the fact …
a radio network, where interference constraints are present. We take into account the fact …
Timing-driven routing for symmetrical array-based FPGAs
In this paper we present a timing-driven router for symmetrical array-based FPGAs. The
routing resources in the FPGAs consist of segments of various lengths. Researchers have …
routing resources in the FPGAs consist of segments of various lengths. Researchers have …
On the complexity of bandwidth allocation in radio networks
R Klasing, N Morales, S Pérennes - Theoretical Computer Science, 2008 - Elsevier
We define and study an optimization problem that is motivated by bandwidth allocation in
radio networks. Because radio transmissions are subject to interference constraints in radio …
radio networks. Because radio transmissions are subject to interference constraints in radio …
Faster deterministic gossiping in directed ad hoc radio networks
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3 log 4 …
deterministic algorithm that solves this problem in an n-node network in time O (n 4/3 log 4 …