Communication and energy efficient routing protocols for single-hop radio networks
From MaRDI portal
Publication:433469
Recommendations
Cites work
- scientific article; zbMATH DE number 1142307 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Expected time bounds for selection
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Cited in
(9)- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
- Correcting Sorted Sequences in a Single Hop Radio Network
- scientific article; zbMATH DE number 2089980 (Why is no real title available?)
- Energy efficient alert in single-hop networks of extremely weak devices
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
- Sorting Long Sequences in a Single Hop Radio Network
- An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks
- SOFSEM 2006: Theory and Practice of Computer Science
- Energy-efficient paths in radio networks
This page was built for publication: Communication and energy efficient routing protocols for single-hop radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433469)