Communication and energy efficient routing protocols for single-hop radio networks
DOI10.1016/J.JPDC.2012.03.004zbMATH Open1242.68027OpenAlexW2072893656MaRDI QIDQ433469FDOQ433469
Authors: Sanguthevar Rajasekaran, Lance Fiondella, Dolly Sharma, Nicholas Lownes, Reda Ammar 
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.03.004
Recommendations
Randomized algorithms (68W20) Analysis of algorithms (68W40) Searching and sorting (68P10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Expected time bounds for selection
- Title not available (Why is that?)
- Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Cited In (8)
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
- SOFSEM 2006: Theory and Practice of Computer Science
- Title not available (Why is that?)
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
- An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks
- Energy-efficient paths in radio networks
- Correcting Sorted Sequences in a Single Hop Radio Network
- Sorting Long Sequences in a Single Hop Radio Network
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)
