Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
Single round simulation on radio networks
Journal of Algorithms
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bootstrapping a hop-optimal network in the weak sensor model
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Initializing sensor networks of non-uniform density in the weak sensor model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
| Hi-index | 0.00 |
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collision of transmissions. However, the scarcest resource in this setting is the energy supply, and radio communication dominates the sensor node energy consumption. Hence, redundant trials of transmission as used in randomized protocols may be counter-effective. Additionally, most of the research work in Sensor Networks is either heuristic or includes unreallistic assumptions. Hence, provable results for many basic problems still remain to be given. In this paper, we study upper and lower bounds for deterministic communication primitives under the harsh constraints of sensor nodes.