Communication and energy efficient routing protocols for single-hop radio networks

DOI10.1016/j.jpdc.2012.03.004zbMath1242.68027OpenAlexW2072893656MaRDI QIDQ433469

Sanguthevar Rajasekaran, Dolly Sharma, Lance Fiondella, Nicholas Lownes, Reda A. 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

zbMATH Keywords

sortingselectionrandomized algorithmssearchingradio networksmessage routing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Expected time bounds for selection
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• 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

This page was built for publication: Communication and energy efficient routing protocols for single-hop radio networks